Patent application number | Description | Published |
20100036865 | Method For Generating Score-Optimal R-Trees - A method of constructing a score-optimal R-tree to support top-k stabbing queries over a set of scored intervals generates a constraint graph from the set, and determines over each node in the constraint graph that has no other nodes pointing to it the node with the smallest left endpoint; for each of these nodes, the associated interval is added to the tree and the node is removed from the constraint graph. | 02-11-2010 |
20100082401 | FORECASTING FOR ADVERTISING INVENTORY ALLOCATION - Subject matter disclosed herein relates to a system for managing online advertising, and in particular, to pricing of advertising inventory and its allocation to advertising campaigns. | 04-01-2010 |
20100082404 | SYSTEM AND METHOD FOR UTILIZING DATE CONSTRAINTS IN AN ADVERTISEMENT SERVING SYSTEM - Generally, embodiments of the present invention provide for methods, systems and computer program products for utilizing date constraints in an advertisement serving system. The method according to one embodiment of the present invention comprises receiving a request for one or more advertisements that satisfy one or more constraints. A set of advertisement contracts is generated, wherein the set of advertisement contracts comprise one or more advertisement contracts that satisfy the one or more constraints. The contractual time period for a given advertisement contract in the set of advertisement contracts is then determined. A subset of advertisement contracts is then generated, wherein the subset of advertisement contracts comprises the advertisement contracts in the set of advertisement contracts that are active on a given date. The subset of advertisement contracts is then inputted into an optimization algorithm and one or more advertisement contracts are selected by the optimization algorithm. | 04-01-2010 |
20100082412 | SYSTEM AND METHOD FOR OPTIMIZING AN ADVERTISEMENT PLAN FOR ALLOCATING ADVERTISEMENTS TO A CONTRACT IN A NETWORK-BASED ENVIRONMENT - The present invention is directed to a system and method for optimizing an advertisement plan for allocating advertisements to a contract in a network-based environment. The system and method includes determining a shadow price for an advertisement placement where the advertisement placement is associated with a user having defined characteristics. The system and method includes determining a contract price for the advertisement placement relative to a plurality of advertisement contracts for the user having the defined characteristics. The system and method includes determining an advertisement plan for allocating an advertisement to a given contract on the basis of the shadow price and the contract price. The system and method includes presenting a given advertisement associated with the given contract according to the advertisement plan on network-based output. | 04-01-2010 |
20100082424 | OFFLINE OPTIMIZATION OF ONLINE PROCESSES - Subject matter disclosed herein relates to a system for managing online resources, and in particular, to a system using an offline process to optimize the management of such online resources. | 04-01-2010 |
20100094881 | SYSTEM AND METHOD FOR INDEXING SUB-SPACES - The present invention is directed to systems and methods for identifying compatible advertisement contracts to satisfy an advertisement opportunity. The systems and methods include receiving a number of attribute values associated with a user accessing a network-based location. The systems and methods include sorting an index of lists for a plurality of advertisement contracts on the basis of a number of contract term values. The systems and methods include traversing the index of lists to return a set advertisement contracts compatible with the number of attribute values associated with the user. The systems and methods include selecting a given advertisement contract from the set of advertisement contracts compatible with the number of attribute values associated with the user. The systems and methods include presenting an advertisement associated with the given advertisement contract on a display viewable by the user accessing the network-based location. | 04-15-2010 |
20100114689 | SYSTEM FOR DISPLAY ADVERTISING OPTIMIZATION USING CLICK OR CONVERSION PERFORMANCE - An advertisement impression distribution system includes a data processing system operable to generate an allocation plan for serving advertisement impressions. The allocation plan allocates a first portion of advertisement impressions to satisfy guaranteed demand and a second portion of advertisement impressions to satisfy non-guaranteed demand. The data processing system includes an optimizer, the optimizer to establish a relationship between the first portion of advertisement impressions and the second portion of advertisement impressions. The relationship defines a range of possible proportions of allocation of the first portion of advertisement impressions and the second portion of advertisement impressions. The optimizer generates a solution in accordance with maximizing guaranteed demand fairness, non-guaranteed demand revenue and click or conversion value, where the solution identifies a determined proportion of the first portion of advertisement impressions to serve and a determined proportion of the second portion of advertisement impressions to serve. The data processing system outputs the allocation plan including the solution to control serving of the advertisement impressions in the determined proportions. | 05-06-2010 |
20100185484 | ALLOCATION OF INTERNET ADVERTISING INVENTORY - A method and system for allocating inventory in an Internet environment is provided. A method employed by the system may include generating several inventory pools, where each inventory pool represents a number of impressions deliverable to different groups of users characterized by attributes. Impressions deliverable to users represented by each inventory pool may be allocated to each inventory pool. Impressions that correspond to multiple pools may be distributed between the multiple pools. The inventory pools may be stored to a database. Afterwards, and order may be received. The order may include parameters that define an audience and a number of impressions. The number of impressions in the order may be allocated from pools in the database. | 07-22-2010 |
20100185485 | ALLOCATION OF INTERNET ADVERTISING INVENTORY - A method and system for allocating inventory in an Internet environment is provided. A method employed by the system may include generating samples of representatives that represent impression inventory, where each sample represents a number of users to which impressions are deliverable. An order may be received. The order may include a number of impressions to book and target audience information. A cushion of impressions needed to guarantee delivery of the number of impressions ordered may be determined. The number of impressions ordered plus the cushion may be allocated from the samples. A contract including the target audience information, the number of impressions, and the cushion may be stored to a database. | 07-22-2010 |
20100185515 | ALLOCATION OF INTERNET ADVERTISING INVENTORY - A method and system for allocating inventory in an Internet environment is provided. A method employed by the system may include generating an inventory pool that represents a number of impressions deliverable to all users, then determining, from multiple past orders for booking impressions, a hierarchy of parameters utilized to target users and a number of impressions deliverable to users characterized by the parameters. The inventory pool may then be partitioned into multiple inventory pools according to the hierarchy, where each inventory pool represents a number of impressions deliverable to users characterized by parameters associated with the inventory pool. The hierarchy of pools may then be stored to a database. | 07-22-2010 |
20100185516 | ALLOCATION OF INTERNET ADVERTISING INVENTORY - A method and system for allocating inventory in an Internet environment is provided. A method employed by the system may include generating multiple top-tier inventory pools and bottom-tier inventory pools that represent impression inventory. Each top-tier pool may represent the combined number of impressions represented by one or more bottom-tier pools. Each top-tier and bottom-tier inventory pool may represent a number of impressions deliverable to users characterized by attributes. Top-tier and bottom-tier inventory pools may be stored to a database. An order for booking impression from the plurality of inventory pools may be received. The order may include parameters that define an audience and a number of impressions. The impressions order may be allocated from top-tier inventory pools when the impressions ordered are entirely represented by top-tier inventory pools. Otherwise the impressions are allocated from bottom-tier inventory pools. | 07-22-2010 |
20100262607 | System and Method for Automatic Matching of Contracts to Impression Opportunities Using Complex Predicates and an Inverted Index - A method for indexing advertising contracts for rapid retrieval and matching in order to match satisfying contracts to advertising slots. The descriptions of the advertising contracts include logical predicates indicating applicability to a particular demographic. Also, the descriptions of advertising slots contain logical predicates indicating applicability to a particular demographic, thus matches can be performed using at least matches on the basis of intersecting demographics. The disclosure contains structure and techniques for receiving a set of contracts with predicates, preparing a data structure index of the set of contracts, receiving an advertising slot with predicates, and structure and techniques for retrieving from the data structure contracts that satisfy a match to the advertising slot predicates. The disclosure includes cases were the predicates are presented in conjoint forms and in disjoint forms, and techniques are provided to consider indexing and matching in cases of IN predicates and well as NOT-IN predicates. | 10-14-2010 |
20100318413 | ALLOCATION OF INTERNET ADVERTISING INVENTORY - A method for determining a price of a contract for booking advertising space in a networked environment includes receiving, via a web server, a request to book a number of impressions from available impression inventory, where each impression corresponds to the delivery of an advertisement to a browser. The method also includes assembling user samples that represent a total amount of impression inventory, where each user sample represents a number of internet users, calculating a value associated with each piece of remaining impression inventory of the total impression inventory, and evaluating the value of all remaining impression inventory before and after allocation to a contract by maximizing and equation subject to a set of constraints. The base price for the contract corresponds to the difference between the value of the inventory before and after allocation. | 12-16-2010 |
20100318432 | ALLOCATION OF INTERNET ADVERTISING INVENTORY - A method for allocating inventory in a networked environment includes receiving a request to purchase a number of display impressions, the request including targeting parameters and a frequency constraint corresponding to a maximum number of times the advertisement can be displayed to a user. The method also includes allocating the requested number of display impressions across a set of user samples, where the number of impressions allocated to any one user sample in the set of user samples is constrained by the frequency constraint. Allocation information that defines how the impressions are allocated among the user samples is stored to a user sample database. | 12-16-2010 |
20110015999 | SYSTEM AND METHOD FOR UTILIZING A LATTICE STORAGE STRUCTURE IN AN ADVERTISEMENT SERVING SYSTEM - Embodiments of the present invention provide for methods, systems and computer program products for utilizing a lattice structure in an advertisement serving system. The method according to one embodiment of the present invention comprises storing one or more advertisement contracts in a lattice structure. A request for one or more advertisements that satisfy one or more constraints is then received and within the lattice structure, a lowest level of one or more pools of advertisement contracts satisfying the one ore more constraints is located. A set of advertisement contracts is generated, wherein the set of advertisement contracts comprise one or more advertisement contracts from lowest level of the lattice structure. The method further comprises adding to the set of advertisement contracts advertisement contracts from the pools of advertisement contracts that are parent to the pools of contracts in the lowest level of the lattice structure. | 01-20-2011 |
20110016109 | System and Method for Automatic Matching of Highest Scoring Contracts to Impression Opportunities Using Complex Predicates and an Inverted Index - A method for indexing advertising contracts for rapid retrieval and matching in order to match only the top N satisfying contracts to advertising slots. Descriptions of advertising contracts include logical predicates indicating weighted applicability to a particular demographic. Descriptions of advertising slots also contain logical predicates indicating weighted applicability to particular demographics, thus matches are performed on the basis of a weighed score of intersecting demographics. Disclosed are structure and techniques for receiving a set of contracts with weighted predicates, preparing a data structure index of the set of contracts, receiving an advertising slot with weighted predicates, and retrieving from the data structure only the top N weighted score contracts that satisfy a match to the advertising slot predicates. Various disclosed cases include predicates presented in conjoint forms and in disjoint forms, and techniques are provided to consider indexing and matching in cases of both IN predicates and NOT-IN predicates. | 01-20-2011 |
20110029377 | SYSTEM AND METHOD FOR FORECASTING AN INVENTORY OF ONLINE ADVERTISEMENT IMPRESSIONS BY SAMPLING IN A MAP-REDUCE FRAMEWORK - An improved system and method for forecasting an inventory of online advertisement impressions by sampling in a map-reduce framework is provided. In a map-reduce framework, samples of visitor profiles may be collected and matched to targeting profiles for displaying advertisements by distributed sample mappers. Sets of samples of visitor profiles matched to the targeting profiles may be mapped and distributed to reducer servers for integrating the samples collected by sample mappers into a reduction sample set for each targeting profile. Each reducer server may aggregate a count of samples of visitor profiles matched to a targeting profile, and the sets of samples of visitor profiles matched to a targeting profile may be integrated into a reduction sample set for each targeting profile. The sample reducers may forecast a targeting profile inventory for each targeting profile and output the targeting profile inventory with a reduction sample set of visitor profiles. | 02-03-2011 |
20110187717 | Producing Optimization Graphs in Online Advertising Systems - A computer implemented system produces an optimization graph in an online advertising system. The system presents at a computer, a supply of advertising inventory and advertising demand contracts, where each advertising inventory is presented as a supply node and each advertising demand contract is presented as a demand node. The system processes the supply of advertising inventory and the advertising demand contracts. For example, the system partitions the supply nodes into supply partitions and determines whether each supply node is eligible for each demand node. In addition, the system determines the number of eligible supply nodes to be drawn from each supply partition for each demand node. | 08-04-2011 |
20110208591 | Forecasting Online Advertising Inventory of Day Parting Queries - Disclosed is a system to forecast a supply of online advertising demand contracts having day parting targets. The system may receive an online advertising demand contract having a flight duration and a day parting target. The received online advertising demand contract may be processed by converting the day parting target into an hour-of-week day parting target vector. If a first day of the flight duration would generate a conflict in view of the hour-of-week day parting target vector, then the system may generate a new first day contract for the first day of the flight duration. | 08-25-2011 |
20110213659 | System and Method for Automatic Matching of Contracts in an Inverted Index to Impression Opportunities Using Complex Predicates and Confidence Threshold Values - A method for automatic matching of contracts to inventory using a fixed-length complex predicate representation. An item of inventory is described as a Boolean expression, which is converted into a multi-level, alternating AND/OR impression tree representation with leaf nodes representing conjuncts. Processing the conjuncts of the tree through a contract index results in retrieving a set of candidate contracts that match the at least some but not necessarily all impression tree leaf node predicates. Next, an AND/OR contract tree representation is constructed with each contract tree leaf node having a label representing a projection onto a discrete set of ordered symbols. Contracts with projections that cover the entire range of discrete set of ordered symbols are deemed to satisfy the item of inventory. Implementation of the contract index includes retrieval techniques to support multi-valued predicates as well as confidence threshold functions using a multi-level tree representation of multi-valued predicates. | 09-01-2011 |
20110213660 | System and Method for Automatic Matching of Contracts in an Inverted Index to Impression Opportunities Using Complex Predicates with Multi-Valued Attributes - A method for automatic matching of contracts to inventory using a fixed-length complex predicate representation. An item of inventory is described as a Boolean expression, which is converted into a multi-level, alternating AND/OR impression tree representation with leaf nodes representing conjuncts. Processing the conjuncts of the tree through a contract index results in retrieving a set of candidate contracts that match the at least some but not necessarily all impression tree leaf node predicates. Next, an AND/OR contract tree representation is constructed with each contract tree leaf node having a label representing a projection onto a discrete set of ordered symbols. Contracts with projections that cover the entire range of discrete set of ordered symbols are deemed to satisfy the item of inventory. Implementation of the contract index includes retrieval techniques to support multi-valued predicates as well as confidence threshold functions using a multi-level tree representation of multi-valued predicates. | 09-01-2011 |
20110213767 | System and Method for Automatic Matching of Contracts Using a Fixed-Length Predicate Representation - A method for automatic matching of contracts to inventory using a fixed-length complex predicate representation. An item of inventory is described as a Boolean expression, which is converted into a multi-level, alternating AND/OR impression tree representation with leaf nodes representing conjuncts. Processing the conjuncts of the tree through a contract index results in retrieving a set of candidate contracts that match the at least some but not necessarily all impression tree leaf node predicates. Next, an AND/OR contract tree representation is constructed with each contract tree leaf node having a label representing a projection onto a discrete set of ordered symbols. Contracts with projections that cover the entire range of discrete set of ordered symbols are deemed to satisfy the item of inventory. Implementation of the contract index includes retrieval techniques to support multi-valued predicates as well as confidence threshold functions using a multi-level tree representation of multi-valued predicates. | 09-01-2011 |
20110225038 | System and Method for Efficiently Evaluating Complex Boolean Expressions - An improved system and method for efficiently evaluating complex Boolean expressions is provided. Leaf nodes of Boolean expression trees for objects represented by Boolean expressions of attribute-value pairs may be assigned a positional identifier that indicates the position of a node in the Boolean expression tree. The positional identifiers of each object may be indexed by attribute-value pairs of the leaf nodes of the Boolean expression trees in an inverted index. Given an input set of attribute-value pairs, a list of positional identifiers for leaf nodes of virtual Boolean expression trees may be found in the index matching the attribute-value pairs of the input set. The list of positional identifiers of leaf nodes may be sorted in order by positional identifier for each contract. An expression evaluator may then verify whether a virtual Boolean expression tree for each contract is satisfied by the list of positional identifiers. | 09-15-2011 |
20110231248 | IMPRESSION-TREND TECHNIQUES FOR PROVIDING A DISPLAY ADVERTISING SUPPLY FORECAST - Techniques are described herein for using an impression-trend technique to provide a display advertising supply forecast. A display advertising supply forecast is an estimate of a number of impressions, which are to occur in a future time period, that have specified attribute values. For example, the specified attribute values may be descriptive of impressions with respect to which an advertiser wishes to place ads. An impression-trend technique is a forecasting technique that uses trends regarding past impressions to forecast a number of future impressions that have specified attribute values. The past impressions include attribute values that are related to the specified attribute values. | 09-22-2011 |
20110246307 | Mass-Based Approach for Serving Impressions in Guaranteed Delivery Advertising - A computer-implemented Internet advertising method for serving impression opportunities in a system for delivery of display advertising. The likelihood that a booked contract could be served by a future forecasted user visit is calculated as a probability mass, and associated with the booked contract. The relative sizes of the probability masses of a plurality of eligible contracts is used as a selector in conjunction with a selected pseudo-random number. In exemplary embodiments, a server is configured for receiving an event predicate as a result of a user visit to a web site. Based on the received event predicate, a set of eligible contracts is assembled. Each eligible contract is assigned to exactly one interval selected from a range, the size of the interval corresponding to the probability mass of the eligible contract. The generated pseudo-random number is used for selecting an interval, which operation selects an eligible advertisement for display. | 10-06-2011 |
20110270676 | Probabilistic Linking Approach for Serving Impressions in Guaranteed Delivery Advertising - A computer-implemented method and display advertising server network for serving impression opportunities to a frequency-capped guaranteed delivery contract in a system for delivery of display advertising to a user. The method includes steps for receiving, from a computer, an event predicate and a user ID corresponding to the user, retrieving, from an index engine, a set of eligible frequency-capped contracts, wherein an eligible contract comprises at least one target predicate matching at least a portion of the event predicate, and probabilistically selecting for serving, in a computer, the booked contract having a frequency cap specification, only when the selected frequency-capped contract can be served to the user without violating the frequency cap specification. Exemplary embodiments include generating a pseudo-random number sequence, and then selecting a particular pseudo-random number from the series of pseudo-random numbers, the selected particular pseudo-random number being based on the user ID, a visit count, a URL. | 11-03-2011 |
20120004957 | FORECASTING SUPPLY FOR ADVERTISEMENTS ACCORDING TO A NON-PARAMETRIC SUPPLY MODEL - Methods, systems, and apparatuses for generating supply forecasts for advertisement impressions are provided. Supply forecasts for future advertisement inventory are enabled to be determined that match attribute values received from a requester in a query or “contract.” Such supply forecasts may be determined based on cumulative or non-cumulative supply forecast values, and may be determined based on time series of supply forecast values for individual impressions or for blocks of impressions. | 01-05-2012 |
20120158495 | INVENTORY ALLOCATION IN ADVERTISING SYSTEMS - A network based advertisement system includes a supply forecasting system configured to select, from a campaign log database, data that defines a plurality of contracts. Each contract specifies requirements that include contract target audience information and a number of impressions. For each contract, the supply forecasting system identifies one or more opportunity samples with characteristics that match contract target audience information of the contract. Each opportunity sample is associated with a weight that corresponds to a number of opportunities with similar characteristics. An optimizer associates the opportunity samples with the contract and then determines whether the opportunity samples are associated with other contracts. The optimizer then limits the number of opportunities associated with the samples that are allocatable to the contract based at least in part on a function of requirements of other contracts associated with the one or more samples. | 06-21-2012 |
20120166259 | Adjusting Demand Parameters To Reduce Allocation Errors in Display Advertising - A system and method for adjusting demand parameters to produce an optimized allocation plan for delivering a plurality of impressions to a plurality of contracts for display advertising. The method commences upon receiving a first eligibility graph, the first eligibility graph comprising a plurality of impressions, a plurality of contracts and at least one first demand parameter. For reducing errors in sampling that affect the eligibility graph, demand parameters contained within the first eligibility graph are adjusted, resulting in an adjusted first eligibility graph. Once the adjusted first eligibility graph is available, a network solver is used for solving the adjusted first eligibility graph to produce an adjusted allocation plan, which adjusted allocation plan is used for displaying at least one of the plurality of impressions. | 06-28-2012 |
20130085868 | SYSTEM AND METHOD FOR GENERATING AN EFFECTIVE BID PER IMPRESSION BASED ON MULTIPLE ATTRIBUTION OF PAY-PER-CONVERSION ADVERTISING - A system and method for calculating an effective bid per impression are disclosed. The system and method may receive a price per conversion bid of an advertiser and information from at least one user. The information may comprise a user state of the user. In some embodiments, the user state may comprise a number of times that the user has previously viewed the advertisement. The user state may be input into a user behavioral model to determine predictive values of the user behavior. An effective bid per impression may then be calculated based on the predictive values of the user and the advertiser's bid per conversion. | 04-04-2013 |
20130166395 | SYSTEM AND METHOD FOR CREATING A DELIVERY ALLOCATION PLAN IN A NETWORK-BASED ENVIRONMENT - The present application provides systems and corresponding methods for creating a delivery allocation plan in a network-based environment. The methods may include receiving and storing advertising contracts and data related to the advertising contracts; constructing a bipartite graph based on the received contract data; annotating each demand node; and receiving impression data and other eligible contract data. Thereafter, the method may include for each impression, calculating a first supply value and for each contract, calculating a first demand value. The first demand value may be used to calculate a second supply value and a delivery allocation may be calculated using the second supply value and the second demand value for each contract. | 06-27-2013 |
20130173384 | METHODS AND SYSTEMS FOR AD PLACEMENT PLANNING - Methods and systems are disclosed which allow shifting inventory to fulfill guaranteed delivery advertisement contracts. Inventory may be allocated from a supply of unallocated inventory to one or more advertisers in accordance with guaranteed delivery agreements. Inventory may be reserved for the one or more advertisers from the remaining supply of unallocated inventory. Inventory may then be allocated to an additional advertiser by using unallocated inventory or shifted inventory, or a combination of unallocated inventory and shifted inventory. The shifted inventory is shifted out of the allocation for the first advertiser and the shifted inventory is replaced by the reserve inventory for the respective advertiser. | 07-04-2013 |
20130246161 | SYSTEMS AND METHODS FOR OPTIMIZATION-AWARE DELIVERY PACING ADJUSTMENT IN ADVERTISEMENT SERVING - Systems and methods for adjusting online ads delivery pace derive, in a computer system, a current impression delivery for an ads display contract. A plurality of estimation bands are delivered corresponding to over delivery and under delivery for the ads display contract. A relative distance is determined between the current impression delivery and the plurality of estimation bands. An adjustment factor is selected according to the relative distance. The adjustment factor is sent to a database. | 09-19-2013 |
20140006144 | METHOD OF CALCULATING A RESERVE PRICE FOR AN AUCTION AND APPARATUS CONDUCTING THE SAME | 01-02-2014 |
20140019232 | IMPRESSION-TREND TECHNIQUES FOR PROVIDING A DISPLAY ADVERTISING SUPPLY FORECAST - Techniques are described herein for using an impression-trend technique to provide a display advertising supply forecast. A display advertising supply forecast is an estimate of a number of impressions, which are to occur in a future time period, that have specified attribute values. For example, the specified attribute values may be descriptive of impressions with respect to which an advertiser wishes to place ads. An impression-trend technique is a forecasting technique that uses trends regarding past impressions to forecast a number of future impressions that have specified attribute values. The past impressions include attribute values that are related to the specified attribute values. | 01-16-2014 |