Patent application number | Description | Published |
20100082393 | DISPLAY ADVERTISING CONTRACT PRICING - Example embodiments described herein may relate to pricing contracts for a display advertising system utilized, for example, in Web-based advertising. | 04-01-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 |
20100082428 | DISPLAY ADVERTISING INVENTORY ESTIMATION - Example embodiments described herein may relate to estimating inventory for a display advertising system utilized, for example, in Web-based advertising. | 04-01-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 |
20100125506 | EXTENDED GENERALIZED SECOND PRICE AUCTION FOR SPONSORED SEARCH WITH RESERVE PRICES - Search engines and sponsored search auctions are provided that enable the use of different reserve prices corresponding to different advertisement slots on a search results page. In one implementation, a search engine includes a query processor and a sponsored search auction. The query processor is configured to receive a query from an electronic device associated with a user, to determine a plurality of reserve prices corresponding to a plurality of advertisement slots of a search results page, and to determine a plurality of bid prices for the advertisement slots of the search results page corresponding to a plurality of bidders. The sponsored search auction is configured to allocate a bidder or a null (e.g., no advertisement) to each advertisement slot of the search results page, taking into account the plurality of reserve prices associated with the advertisement slots of the search results page. | 05-20-2010 |
20100131364 | TRUTHFUL PRICING SCHEME FOR SPONSORED SEARCH WITH RESERVE PRICES - Search engines and sponsored search auctions are provided that enable the use of different reserve prices corresponding to different advertisement slots on a search results page. In one implementation, a search engine includes a query processor and a sponsored search auction. The query processor is configured to receive a query from an electronic device associated with a user, to determine a plurality of reserve prices corresponding to a plurality of advertisement slots of a search results page, and to determine a plurality of bid prices for the advertisement slots of the search results page corresponding to a plurality of bidders. The sponsored search auction is configured to allocate a bidder or a null (e.g., no advertisement) to each advertisement slot of the search results page, taking into account click through rate information regarding the plurality of bidders. | 05-27-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 |
20100198688 | METHOD, SYSTEM, OR APPARATUS FOR A TRUTHFUL PRICING SCHEME FOR A SELLER - Embodiments of methods, apparatuses, or systems relating to truthful pricing schemes for a seller. | 08-05-2010 |
20100250332 | System and Method for Adaptive Bidding for Display Advertising - A system for performing adaptive bidding to secure Internet advertising impressions in an auction. Included are systems for analyzing advertising campaign objectives, including a campaign period, a target number of impressions, a target budget. An exemplary technique defines a bidding agent for performing the adaptive bidding seeking the minimum target spending of the budget. Objective results of the campaign such as average cost per won impression, total campaign duration relative to desired campaign period, and total expenditure relative to campaign budget can be optimized based on an empirically determined forecast. Techniques for adapting bids include statistically modeling winning bids during an exploration bidding phase, performing iterations for adjustment of the bid amounts using learn-while-bid adaptive bidding, learn-then-bid adaptive bidding, and guess-double-adjust adaptive bidding. Bidding tactics, especially those used to identify a minimum target bid and a maximum target bid used in bidding on an exchange are employed, and the results analyzed using statistical models. | 09-30-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 |
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 |
20110179019 | SYSTEM AND METHOD FOR FINDING UNEXPECTED, BUT RELEVANT CONTENT IN AN INFORMATION RETRIEVAL SYSTEM - An improved method for information retrieval in web query and recommendation systems, where items that are likely unfamiliar to the users of the system, but potentially relevant, are recommended. In a recommendation system having ratings by a plurality of users for a plurality of items, items are assigned to one or more data regions based on item attributes or user activity. Source regions are identified for each of the data regions. For a given user, data regions with which both the user and the user's social network are unfamiliar are identified. Within a given data region, the relevance of items to the user within such regions is evaluated using ratings provided by other users who have entered ratings similar to the user in source regions for the data region. Items receiving the highest relevance score are recommended to the user. | 07-21-2011 |
20110208559 | Automatic Management of Networked Publisher-Subscriber Relationships - Automatic management of networked publisher-subscriber relationships in an advertising server network. The method comprises steps for constructing a directed graph representation comprising at least one publisher node (e.g. an Internet property), at least one subscriber node (e.g. an Internet advertiser), at least one intermediary node (e.g. an Internet advertising agent), and at least one edge (e.g. an advertising target predicate) wherein any one of the edges is directly associated with at least one target predicate. The directed graph representation is used in conjunction with an inverted index for retrieving a valid node list comprising only nodes having at least one target predicate that matches at least one event predicate. The event predicate (as well as any target predicate) is any arbitrarily complex Boolean expression, and is used in producing a result node list comprising only nodes that concurrently match the event predicate with an advertising target predicate and are reachable. | 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 |
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 |
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 |
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 |
20130268374 | Learning Accounts - Techniques are provided for use in an auction in which selected content items, or advertisements, of content providers, or advertisers, are selected and served, and in which, for an item served in response to a serving opportunity, contingent upon occurrence of a specified user action, an associated provider's account is charged a first sum and an associated publisher's account is credited a second sum. Performance of particular content items may be explored, such as ones for which little or no historical performance information may be available. Content item selection may be based at least in part on an objective of acquiring learning information that can be used in prediction of future performance of the content item. The associated provider's account may be charged a sum that reflects a learning value component, but the associated publisher's account may be credited a sum that does not reflect a learning value component. | 10-10-2013 |
20140006141 | METHODS INCORPORATING PACING CONSTRIANTS FOR BIDDING ONLINE ADVERTISEMENT DISPLAY AND APPARATUS CONDUCTING THE SAME | 01-02-2014 |
20140006144 | METHOD OF CALCULATING A RESERVE PRICE FOR AN AUCTION AND APPARATUS CONDUCTING THE SAME | 01-02-2014 |
20140006171 | METHOD OF OFFLINE EXPERIMENTATION ENVIRONMENT AND APPARATUS CONDUCTING THE SAME | 01-02-2014 |
20140089106 | METHOD AND SYSTEM FOR FORMULATING BIDS FOR INTERNET ADVERTISING USING FORECAST DATA - A system and method for formulating a bid on an impression for an Internet advertising campaign using market forecast data are provided. The system and method comprise determining a bid policy using an advertiser goal type, an advertiser payment type, and a budget parameter. Historical impression data pertaining to the advertising campaign is sampled using any applicable sampling technique. The sampled data is used to derive forecast data that predicts the future state of the market. The bid policy and the forecast data are used to derive a spend curve, from which an optimal bid is formulated that results in a proper and efficient allocation of the advertiser's budget. | 03-27-2014 |
20140095323 | Method of Second Price Auction with Monopoly Reserve Price and Apparatus Conducting the Same - The present application relates to systems and computer-implemented methods for conducting a second price auction associated with an opportunity to realize an online advertisement. In some implementations, advertisers may be informed with the opportunity to realize the online advertisement, and may be provided with information associated with a user that may view the opportunity to realize the online advertisement; an individual reserve price may then be determined for each advertiser, based on the advertiser's individual bidding preference and the information associated with the user; and then the auction may be conducted to determine a winning bidder among candidate advertisers whose bidding price is higher than the individual reserve price associated therewith, using second price method. | 04-03-2014 |
20140118355 | Systems and Methods for Generating A Dense Graph - Methods and systems for generating a dense graph are described. One of the methods includes receiving a graph and computing a threshold to apply to the graph. The method further includes determining whether the graph includes a first set of at least one node, determining whether a second set of at least one node from the first set meets the threshold, and removing the at least one node of the second set concurrently from the graph upon determining that the at least one node of the second set meets the threshold. The operation of removing is performed to generate an updated graph. The method includes determining whether a density of the updated graph is greater than a density of the graph and replacing the graph within the updated graph upon determining that the density of the updated graph is greater than the density of the density of the graph. | 05-01-2014 |
20140122221 | OPTIMIZING BIDDING WITH MULTIPLE CAMPAIGN TYPES - A method, system, and computer program product for optimizing bidding over multiple advertising campaigns having a least two campaign types. The optimization is subjected to at least one constraint quantifying a multiple campaign spending limit amount. The method commences by identifying a collection of the multiple advertising campaigns, then evaluating each of the constituent member advertising campaigns to determine its respective optimized spending amount. Then the method calculates (e.g., sums) an aggregate spending amount by aggregating the individual campaign spending amounts. When the aggregate spending amount is greater than the multiple campaign constraint, then the method apportions the multiple campaign spending limit amount to the constituent member advertising campaigns which is in turn used to determine a reduced spending limit. The time period under which the spending is optimized can be any time period suited for forming bids to bid on inventory of impressions into which advertisements can be placed. | 05-01-2014 |
20140122253 | SYSTEMS AND METHODS FOR IMPLEMENTING BID ADJUSTMENTS IN AN ONLINE ADVERTISEMENT EXCHANGE - A system and method for implementing bid adjustments in an online advertisement exchange are disclosed. A plurality of bids from a plurality of advertisers may be received for an online advertisement opportunity. A first advertiser may be associated with a first bid bias value. In some embodiments, if the first advertiser is associated with a first bid bias value, then the bid received from the first advertiser may be adjusted based on the first bid bias value. For example, an adjusted bid may be calculated based on the bid received from the first advertiser and the first bid bias value. The online advertisement exchange may conduct an online auction with the adjusted bid from the first advertiser. If the first advertiser wins the auction based on the adjusted bid, then the first advertiser may be charged the value of the bid received from the first advertiser instead of the adjusted bid value. | 05-01-2014 |