US20140297401A1 - Shaping allocations in search advertising auctions - Google Patents
Shaping allocations in search advertising auctions Download PDFInfo
- Publication number
- US20140297401A1 US20140297401A1 US13/851,753 US201313851753A US2014297401A1 US 20140297401 A1 US20140297401 A1 US 20140297401A1 US 201313851753 A US201313851753 A US 201313851753A US 2014297401 A1 US2014297401 A1 US 2014297401A1
- Authority
- US
- United States
- Prior art keywords
- primary
- bidders
- serving opportunities
- advertisement
- advertising
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0241—Advertisements
- G06Q30/0273—Determination of fees for advertising
- G06Q30/0275—Auctions
Definitions
- an auction is often used, in which advertisers bid for allocation and serving of their online advertisements in connection with serving opportunities.
- search advertising user-entered keyword queries provide an excellent signal for determining user intent and for targeting the user with an online advertisement.
- Resulting advertisements are often displayed (or otherwise presented) along with each other. Advertisements may be displayed in a particular order, pattern or rank, or considered to be displayed in a particular order, pattern or rank, in terms of placement on a page. Generally, higher ranked or better placed advertisements are more valuable to advertisers, since they are generally more prominently displayed to users, and they are generally associated with better performance and expected revenue generation.
- Online search advertising may be sold through slot auctions.
- bidders may be allocated different slots based on their bids, with the highest bidder awarded the most valuable slot, the second highest bidder awarded the second most valuable slot, etc. For example, if the second slot is nearly as valuable as the first slot, then there may be less competition for the first slot. As a result, the seller is likely to get less revenue.
- the seller can partition the second slot, awarding portions of it to multiple bidders. For example, two-thirds of the second slot can be awarded to the second highest bidder and one-third to the third-highest bidder.
- One way to apportion is to award the second slot at random, with probabilities equal to the portions. In the example, this would mean the second slot is awarded to the second highest bidder with probability two-thirds and to the third-highest bidder with probability one-third.
- Another way is to apportion over multiple auctions. In the example, this would mean awarding the second slot to the second-highest bidder in two-thirds of auctions and to the third highest bidder in one third of auctions.
- the result of apportioning actual slots may be to create virtual slots.
- what may have been an actual two-slot auction would become a virtual three-slot auction.
- the seller or their representative can shape allocations so that each virtual slot is much more valuable than the virtual slot awarded to the next-lower bidder. The likely result is more competitive bidding and more revenue for the seller.
- Some embodiments of the invention provide bidding techniques for use with online advertising auctions.
- methods and systems are provided for bidding for display of an advertisement, where the allocation of serving opportunities that takes into account competing bids present upon display of the advertisement.
- a primary bidder is identified as the advertiser with the highest (i.e. winning) bid and which is allocated serving opportunities in a primary advertising slot. Accordingly, the remaining non-primary (i.e. non-winning) bidders/advertisers are allocated serving opportunities in non-primary advertising slots.
- the term “primary advertising slot” is determined and designated by an auction operator or facilitator.
- determining the “primary advertising slot” includes, but is not limited to, placement with respect to other advertisement slots, size, prominence, cost, value, and/or metrics such as predicted conversion rate or CTR.
- “non-primary advertising slots” are advertising slots other than the “primary advertising slot”.
- Auction mechanisms allow more efficient operation of auctions that allow such bidding techniques, from the perspectives of the auction provider, advertisers, and the marketplace as a whole.
- Some embodiments of the invention provide auction mechanisms that, while new and non-obvious over existing auction systems, can yet be implemented by modification of or addition to existing Generalized Second Price (or “GSP”) auction formats and associated computer-related implementation platforms, hardware and software. Furthermore, some embodiments do not cause changes, or cause minimal changes, from the advertiser experience perspective, relative to GSP auction formats.
- GSP Generalized Second Price
- Other auction mechanisms are provided that differ more from GSP auction formats.
- Some embodiments of the invention are described relative to a known GSP auction format.
- a GSP auction in connection with a particular serving opportunity, one or more available advertising slots are filled with matching advertisement displays. Winners of the slots may be based, for example, on a bid alone, or a term including bid and one or more other factors, such as bid multiplied by an associated click through rate, which may be a determined, forecasted or estimated click through rate. Other terms, variables or constants can also be included in more complex terms. Pricing for each slot is generally determined based on the bid (or term including bid) associated with the next lower pertinent bid.
- pricing for a first slot is determined based on the bid or bid term associated with the second slot, such as by setting the price at, or at a minimum amount more than, the bid or bid term associated with the second slot, etc.
- allocation of all serving opportunities in the first slot is to the advertiser with the highest bid while serving opportunities are unbundled from the remaining advertising slots and allocated amongst the remaining advertisers with lesser bids.
- FIG. 1 is a distributed computer system according to one embodiment of the invention.
- FIG. 2 is a simplified flow diagram illustrating a method according to one embodiment of the invention.
- FIG. 3 is a simplified flow diagram illustrating a method according to one embodiment of the invention.
- FIG. 4 is a simplified flow diagram illustrating a method according to one embodiment of the invention.
- FIG. 5 is a conceptual diagram illustrating a method according to one embodiment of the invention.
- FIG. 6 is a conceptual block diagram illustrating one embodiment of the invention.
- a serving opportunity or particular serving opportunity can include forecasted, future, or equivalent serving opportunities.
- Some embodiments of the invention provide bidding techniques or languages for use with online advertising auctions.
- methods and systems are provided relating to bidding for display of an advertisement, where the allocation of serving opportunities takes into account one or more competing bids to better determine the value of the serving opportunities.
- methods and systems are provided in which bidding takes into account the effect, or perceived, anticipated, estimated or forecasted effect, on the value of display of an advertisement, of competing bids on the value of advertisement impressions in various advertisement slots.
- various known methods may be used in making a determination, such as a determination as to which outcome may be most beneficial or desirable to an auction operator or facilitator.
- bidding and auction mechanisms are described herein for simplicity in connection with a bid term that includes only the bid, the invention contemplates embodiments in which more complex bid terms are utilized, including in determinations relating to exclusive or multiple advertisement display outcomes, and in determining pricing.
- FIG. 1 is a distributed computer system 100 according to one embodiment of the invention.
- the system 100 includes user computers 104 , advertiser computers 106 and server computers 108 , all coupled or able to be coupled to the Internet 102 .
- the Internet 102 is depicted, the invention contemplates other embodiments in which the Internet is not includes, as well as embodiments in which other networks are included in addition to the Internet, including one more wireless networks, WANs, LANs, telephone, cell phone, or other data networks, etc.
- the invention further contemplates embodiments in which user computers or other computers may be or include a wireless, portable, or handheld devices such as cell phones, PDAs, etc.
- Each of the one or more computers 104 , 106 , 108 may be distributed, and can include various hardware, software, applications, programs and tools. Depicted computers may also include a hard drive, monitor, keyboard, pointing or selecting device, etc. The computers may operate using an operating system such as Windows by Microsoft, etc. Each computer may include a central processing unit (CPU), data storage device, and various amounts of memory including RAM and ROM. Depicted computers may also include various programming, applications, and software to enable searching, search results, and advertising, such as graphical or banner advertising as well as keyword searching and advertising in a sponsored search context. All types of advertisements are contemplated, including textual advertisements, rich advertisements, video advertisements, etc.
- each of the server computers 108 includes one or more CPUs 110 and a data storage device 112 .
- the data storage device 112 includes a database 116 and an Allocation of Serving Opportunities Auction Program 114 .
- the Allocation of Serving Opportunities Auction Program 114 is intended to broadly include all programming, applications, software and other and tools necessary to implement or facilitate methods and systems according to embodiments of the invention, whether on a single server computer or distributed among multiple computers of devices.
- FIG. 2 is a simplified flow diagram illustrating a method 200 according to one embodiment of the invention.
- a first set of information comprising bid data from a plurality of bidders for one or more serving opportunities for one or more advertisement slots.
- the bid data is comprised of one or more advertising bids from each of the bidders. These bids associated with advertisers are obtained for use in an online advertising auction.
- a second set of information is obtained comprising historical online advertising bidding and delivery information.
- allocation data is generated for display of advertisements associated with the each of the bids.
- the allocation data defines a number of serving opportunities that each of the bidders is allocated for each advertisement slot and is based on a non-linear function of the historical online advertising bidding and delivery information.
- the serving opportunities are allocated among the bidders for each of the advertisement slots.
- FIG. 3 is a simplified flow diagram illustrating a method 200 according to one embodiment of the invention.
- a first set of information comprising bid data from a plurality of bidders for one or more serving opportunities for one or more advertisement slots.
- the bid data is comprised of one or more advertising bids from each of the bidders. These bids associated with advertisers are obtained for use in an online advertising auction.
- allocation data is generated for display of advertisements associated with the each of the bids.
- the allocation data defines a number of serving opportunities that each of the bidders is allocated for each advertisement slot.
- the serving opportunities are allocated among the bidders for each of the advertisement slots.
- the serving opportunities are semi-randomly allocated among the bidders, where the semi-random allocation is weighted based on the allocation data.
- FIG. 4 is a simplified flow diagram illustrating a method 400 according to one embodiment of the invention.
- a first set of information comprising bid data from a plurality of bidders for one or more serving opportunities for one or more advertisement slots.
- the bid data is comprised of one or more advertising bids from each of the bidders. These bids associated with advertisers are obtained for use in an online advertising auction.
- a second set of information is obtained comprising a performance metric of the serving opportunities in the advertisement slots.
- the performance metric is based on at least an expected click through rate.
- allocation data is generated for display of advertisements associated with the each of the bids.
- the allocation data defines a number of serving opportunities that each of the bidders is allocated for each advertisement slot and is based on at least the performance metric.
- the serving opportunities are allocated among the bidders for each of the advertisement slots. The bidder for which the highest bid was received is allocated all serving opportunities of one of the advertising slots.
- FIG. 5 is a conceptual block diagram illustrating a method 500 according to one embodiment of the invention. The diagram is simplified to illustrate the concepts underlying the claimed subject matter.
- Steps 502 , 504 , and 506 represent three distinct and consecutive impressions, with serving opportunities for advertisements available in four advertisement slots, labeled Slot 1, Slot 2, Slot 3, and Slot 4.
- a first place bid, second place bid, third place bid, and fourth place bid have been received for advertising in these slots.
- the first place bid having won the online advertising auction, is allocated a serving opportunity in Slot 1 in all three impressions 502 , 504 , and 506 .
- the second place bid, third place bid, and fourth place bid are allocated various slots in each of the different impressions 502 , 504 , and 506 .
- the second place bid is allocated the serving opportunity in Slot 2 in 502 , in Slot 3 in 504 , and in Slot 2 in 506 .
- the third place bid is allocated the serving opportunity in Slot 3 in 502 , in Slot 2 in 504 , and in Slot 3 in 506 .
- the fourth place bid is allocated the serving opportunity in Slot 4 in 502 , in Slot 4 in 504 , and in Slot 3 in 506 .
- FIG. 6 is a conceptual block diagram illustrating a method 500 according to one embodiment of the invention.
- Advertising bids 602 are received and used to generate allocation data 604 for the purposes of allocating serving opportunities amongst bids 602 in an auction-based online advertising marketplace 606 .
- a database 612 is communicatively coupled to both allocation data 604 and the auction-based online advertising marketplace 606 . Additionally, the database 612 is communicatively coupled to both performance metric information 610 and historical online advertising bidding and delivery information 608 . Through this arrangement, the database 612 can facilitate utilizing the historical online advertising bidding and delivery information 608 and/or performance metric information 610 in determining both the allocation data 604 and/or the eventual allocation in the auction-based online advertising marketplace 606 . Similarly, the database 612 can facilitate utilizing the generated allocation data 604 and conditions of the auction-based online advertising marketplace 606 to create, replenish, and/or edit both utilizing the historical online advertising bidding and delivery information 608 and/or performance metric information 610 .
Abstract
Description
- In online advertising, an auction is often used, in which advertisers bid for allocation and serving of their online advertisements in connection with serving opportunities. For example, in search advertising, user-entered keyword queries provide an excellent signal for determining user intent and for targeting the user with an online advertisement. Resulting advertisements are often displayed (or otherwise presented) along with each other. Advertisements may be displayed in a particular order, pattern or rank, or considered to be displayed in a particular order, pattern or rank, in terms of placement on a page. Generally, higher ranked or better placed advertisements are more valuable to advertisers, since they are generally more prominently displayed to users, and they are generally associated with better performance and expected revenue generation.
- Online search advertising may be sold through slot auctions. In a slot auction, bidders may be allocated different slots based on their bids, with the highest bidder awarded the most valuable slot, the second highest bidder awarded the second most valuable slot, etc. For example, if the second slot is nearly as valuable as the first slot, then there may be less competition for the first slot. As a result, the seller is likely to get less revenue.
- In some embodiments, for example, to increase the gap in value between the first and second slots, the seller can partition the second slot, awarding portions of it to multiple bidders. For example, two-thirds of the second slot can be awarded to the second highest bidder and one-third to the third-highest bidder. One way to apportion is to award the second slot at random, with probabilities equal to the portions. In the example, this would mean the second slot is awarded to the second highest bidder with probability two-thirds and to the third-highest bidder with probability one-third. Another way is to apportion over multiple auctions. In the example, this would mean awarding the second slot to the second-highest bidder in two-thirds of auctions and to the third highest bidder in one third of auctions.
- In some embodiments, the result of apportioning actual slots may be to create virtual slots. In the above example, what may have been an actual two-slot auction would become a virtual three-slot auction. By setting the portions of actual slots allocated to virtual slots, the seller or their representative can shape allocations so that each virtual slot is much more valuable than the virtual slot awarded to the next-lower bidder. The likely result is more competitive bidding and more revenue for the seller.
- Some embodiments of the invention provide bidding techniques for use with online advertising auctions. In some embodiments, methods and systems are provided for bidding for display of an advertisement, where the allocation of serving opportunities that takes into account competing bids present upon display of the advertisement. For example, methods and systems are provided in which a primary bidder is identified as the advertiser with the highest (i.e. winning) bid and which is allocated serving opportunities in a primary advertising slot. Accordingly, the remaining non-primary (i.e. non-winning) bidders/advertisers are allocated serving opportunities in non-primary advertising slots. The term “primary advertising slot” is determined and designated by an auction operator or facilitator. In some embodiments of the invention, determining the “primary advertising slot” includes, but is not limited to, placement with respect to other advertisement slots, size, prominence, cost, value, and/or metrics such as predicted conversion rate or CTR. By definition, “non-primary advertising slots” are advertising slots other than the “primary advertising slot”.
- Auction mechanisms are provided that allow more efficient operation of auctions that allow such bidding techniques, from the perspectives of the auction provider, advertisers, and the marketplace as a whole. Some embodiments of the invention provide auction mechanisms that, while new and non-obvious over existing auction systems, can yet be implemented by modification of or addition to existing Generalized Second Price (or “GSP”) auction formats and associated computer-related implementation platforms, hardware and software. Furthermore, some embodiments do not cause changes, or cause minimal changes, from the advertiser experience perspective, relative to GSP auction formats. Other auction mechanisms are provided that differ more from GSP auction formats.
- Some embodiments of the invention are described relative to a known GSP auction format. In a GSP auction, in connection with a particular serving opportunity, one or more available advertising slots are filled with matching advertisement displays. Winners of the slots may be based, for example, on a bid alone, or a term including bid and one or more other factors, such as bid multiplied by an associated click through rate, which may be a determined, forecasted or estimated click through rate. Other terms, variables or constants can also be included in more complex terms. Pricing for each slot is generally determined based on the bid (or term including bid) associated with the next lower pertinent bid. So, for example, pricing for a first slot is determined based on the bid or bid term associated with the second slot, such as by setting the price at, or at a minimum amount more than, the bid or bid term associated with the second slot, etc. In some embodiments of the invention, allocation of all serving opportunities in the first slot is to the advertiser with the highest bid while serving opportunities are unbundled from the remaining advertising slots and allocated amongst the remaining advertisers with lesser bids.
-
FIG. 1 is a distributed computer system according to one embodiment of the invention; -
FIG. 2 is a simplified flow diagram illustrating a method according to one embodiment of the invention; -
FIG. 3 is a simplified flow diagram illustrating a method according to one embodiment of the invention; -
FIG. 4 is a simplified flow diagram illustrating a method according to one embodiment of the invention; -
FIG. 5 is a conceptual diagram illustrating a method according to one embodiment of the invention; and -
FIG. 6 is a conceptual block diagram illustrating one embodiment of the invention. - Herein, the term “advertiser” broadly includes anyone, any entity, or any automated system that acts or facilitates action on behalf of an advertiser or an advertising campaign associated with an advertiser, and the term “bidding” broadly includes both human and automated techniques. Herein, a serving opportunity or particular serving opportunity can include forecasted, future, or equivalent serving opportunities.
- Some embodiments of the invention provide bidding techniques or languages for use with online advertising auctions. In some embodiments, methods and systems are provided relating to bidding for display of an advertisement, where the allocation of serving opportunities takes into account one or more competing bids to better determine the value of the serving opportunities. For example, methods and systems are provided in which bidding takes into account the effect, or perceived, anticipated, estimated or forecasted effect, on the value of display of an advertisement, of competing bids on the value of advertisement impressions in various advertisement slots.
- Herein, in situations where comparisons between values yield an equality, various known methods may be used in making a determination, such as a determination as to which outcome may be most beneficial or desirable to an auction operator or facilitator.
- It is to be understood that, while bidding and auction mechanisms are described herein for simplicity in connection with a bid term that includes only the bid, the invention contemplates embodiments in which more complex bid terms are utilized, including in determinations relating to exclusive or multiple advertisement display outcomes, and in determining pricing.
-
FIG. 1 is adistributed computer system 100 according to one embodiment of the invention. Thesystem 100 includesuser computers 104,advertiser computers 106 andserver computers 108, all coupled or able to be coupled to the Internet 102. Although the Internet 102 is depicted, the invention contemplates other embodiments in which the Internet is not includes, as well as embodiments in which other networks are included in addition to the Internet, including one more wireless networks, WANs, LANs, telephone, cell phone, or other data networks, etc. The invention further contemplates embodiments in which user computers or other computers may be or include a wireless, portable, or handheld devices such as cell phones, PDAs, etc. - Each of the one or
more computers - As depicted, each of the
server computers 108 includes one ormore CPUs 110 and adata storage device 112. Thedata storage device 112 includes adatabase 116 and an Allocation of ServingOpportunities Auction Program 114. - The Allocation of Serving
Opportunities Auction Program 114 is intended to broadly include all programming, applications, software and other and tools necessary to implement or facilitate methods and systems according to embodiments of the invention, whether on a single server computer or distributed among multiple computers of devices. -
FIG. 2 is a simplified flow diagram illustrating amethod 200 according to one embodiment of the invention. - At
step 202, using one or more computers, a first set of information is obtained comprising bid data from a plurality of bidders for one or more serving opportunities for one or more advertisement slots. The bid data is comprised of one or more advertising bids from each of the bidders. These bids associated with advertisers are obtained for use in an online advertising auction. - At
step 204, using one or more computers, a second set of information is obtained comprising historical online advertising bidding and delivery information. Atstep 206, using one or more computers, based on at least the first and second sets of information, allocation data is generated for display of advertisements associated with the each of the bids. The allocation data defines a number of serving opportunities that each of the bidders is allocated for each advertisement slot and is based on a non-linear function of the historical online advertising bidding and delivery information. Atstep 208, using one or more computers, based on at least the allocation data, the serving opportunities are allocated among the bidders for each of the advertisement slots. -
FIG. 3 is a simplified flow diagram illustrating amethod 200 according to one embodiment of the invention. - At
step 302, using one or more computers, a first set of information is obtained comprising bid data from a plurality of bidders for one or more serving opportunities for one or more advertisement slots. The bid data is comprised of one or more advertising bids from each of the bidders. These bids associated with advertisers are obtained for use in an online advertising auction. - At
step 304, based on at least the first set of information, allocation data is generated for display of advertisements associated with the each of the bids. The allocation data defines a number of serving opportunities that each of the bidders is allocated for each advertisement slot. Atstep 306, using one or more computers, based on at least the allocation data, the serving opportunities are allocated among the bidders for each of the advertisement slots. The serving opportunities are semi-randomly allocated among the bidders, where the semi-random allocation is weighted based on the allocation data. -
FIG. 4 is a simplified flow diagram illustrating amethod 400 according to one embodiment of the invention. - At
step 402, using one or more computers, a first set of information is obtained comprising bid data from a plurality of bidders for one or more serving opportunities for one or more advertisement slots. The bid data is comprised of one or more advertising bids from each of the bidders. These bids associated with advertisers are obtained for use in an online advertising auction. - At
step 404, using one or more computers, a second set of information is obtained comprising a performance metric of the serving opportunities in the advertisement slots. The performance metric is based on at least an expected click through rate. Atstep 406, using one or more computers, based on at least the first and second sets of information, allocation data is generated for display of advertisements associated with the each of the bids. The allocation data defines a number of serving opportunities that each of the bidders is allocated for each advertisement slot and is based on at least the performance metric. Atstep 408, using one or more computers, based on at least the allocation data, the serving opportunities are allocated among the bidders for each of the advertisement slots. The bidder for which the highest bid was received is allocated all serving opportunities of one of the advertising slots. -
FIG. 5 is a conceptual block diagram illustrating amethod 500 according to one embodiment of the invention. The diagram is simplified to illustrate the concepts underlying the claimed subject matter. -
Steps Slot 1,Slot 2,Slot 3, andSlot 4. A first place bid, second place bid, third place bid, and fourth place bid have been received for advertising in these slots. - The first place bid, having won the online advertising auction, is allocated a serving opportunity in
Slot 1 in all threeimpressions - The second place bid, third place bid, and fourth place bid are allocated various slots in each of the
different impressions Slot 2 in 502, inSlot 3 in 504, and inSlot 2 in 506. The third place bid is allocated the serving opportunity inSlot 3 in 502, inSlot 2 in 504, and inSlot 3 in 506. The fourth place bid is allocated the serving opportunity inSlot 4 in 502, inSlot 4 in 504, and inSlot 3 in 506. -
FIG. 6 is a conceptual block diagram illustrating amethod 500 according to one embodiment of the invention. - Advertising bids 602 are received and used to generate
allocation data 604 for the purposes of allocating serving opportunities amongstbids 602 in an auction-basedonline advertising marketplace 606. Adatabase 612 is communicatively coupled to bothallocation data 604 and the auction-basedonline advertising marketplace 606. Additionally, thedatabase 612 is communicatively coupled to both performancemetric information 610 and historical online advertising bidding anddelivery information 608. Through this arrangement, thedatabase 612 can facilitate utilizing the historical online advertising bidding anddelivery information 608 and/or performancemetric information 610 in determining both theallocation data 604 and/or the eventual allocation in the auction-basedonline advertising marketplace 606. Similarly, thedatabase 612 can facilitate utilizing the generatedallocation data 604 and conditions of the auction-basedonline advertising marketplace 606 to create, replenish, and/or edit both utilizing the historical online advertising bidding anddelivery information 608 and/or performancemetric information 610. - The foregoing description is intended merely to be illustrative, and other embodiments are contemplated within the spirit of the invention.
Claims (20)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US13/851,753 US20140297401A1 (en) | 2013-03-27 | 2013-03-27 | Shaping allocations in search advertising auctions |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US13/851,753 US20140297401A1 (en) | 2013-03-27 | 2013-03-27 | Shaping allocations in search advertising auctions |
Publications (1)
Publication Number | Publication Date |
---|---|
US20140297401A1 true US20140297401A1 (en) | 2014-10-02 |
Family
ID=51621763
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US13/851,753 Abandoned US20140297401A1 (en) | 2013-03-27 | 2013-03-27 | Shaping allocations in search advertising auctions |
Country Status (1)
Country | Link |
---|---|
US (1) | US20140297401A1 (en) |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9552437B1 (en) * | 2014-06-24 | 2017-01-24 | Outbrain Inc. | Content position recommendations |
US20200234342A1 (en) * | 2019-01-18 | 2020-07-23 | Timehop, Inc. | Programmatic advertising server |
US20210272165A1 (en) * | 2013-06-28 | 2021-09-02 | Groupon, Inc. | Method and apparatus for generating an electronic communication |
US20220101402A1 (en) * | 2020-09-25 | 2022-03-31 | Content Square SAS | System and method for determining an attractiveness value of a product displayed on an online platform, and generating insights respective thereof |
US11710154B2 (en) | 2013-06-07 | 2023-07-25 | Groupon, Inc. | Method, apparatus, and computer program product for facilitating dynamic pricing |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20060106709A1 (en) * | 2004-10-29 | 2006-05-18 | Microsoft Corporation | Systems and methods for allocating placement of content items on a rendered page based upon bid value |
US20100131364A1 (en) * | 2008-11-24 | 2010-05-27 | Yahoo! Inc. | Truthful pricing scheme for sponsored search with reserve prices |
US20100198695A1 (en) * | 2009-01-30 | 2010-08-05 | Google Inc. | Advertisement Slot Allocation |
US20120158522A1 (en) * | 2010-12-17 | 2012-06-21 | Microsoft Corporation | Randomized auctions with priority option |
-
2013
- 2013-03-27 US US13/851,753 patent/US20140297401A1/en not_active Abandoned
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20060106709A1 (en) * | 2004-10-29 | 2006-05-18 | Microsoft Corporation | Systems and methods for allocating placement of content items on a rendered page based upon bid value |
US20100131364A1 (en) * | 2008-11-24 | 2010-05-27 | Yahoo! Inc. | Truthful pricing scheme for sponsored search with reserve prices |
US20100198695A1 (en) * | 2009-01-30 | 2010-08-05 | Google Inc. | Advertisement Slot Allocation |
US20120158522A1 (en) * | 2010-12-17 | 2012-06-21 | Microsoft Corporation | Randomized auctions with priority option |
Cited By (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US11710154B2 (en) | 2013-06-07 | 2023-07-25 | Groupon, Inc. | Method, apparatus, and computer program product for facilitating dynamic pricing |
US20210272165A1 (en) * | 2013-06-28 | 2021-09-02 | Groupon, Inc. | Method and apparatus for generating an electronic communication |
US11783378B2 (en) * | 2013-06-28 | 2023-10-10 | Groupon, Inc. | Method and apparatus for generating an electronic communication |
US9552437B1 (en) * | 2014-06-24 | 2017-01-24 | Outbrain Inc. | Content position recommendations |
US20200234342A1 (en) * | 2019-01-18 | 2020-07-23 | Timehop, Inc. | Programmatic advertising server |
WO2020150673A1 (en) | 2019-01-18 | 2020-07-23 | Timehop, Inc. | Programmatic advertising server |
US11507982B2 (en) * | 2019-01-18 | 2022-11-22 | Timehop, Inc. | Programmatic advertising server |
US11720931B2 (en) | 2019-01-18 | 2023-08-08 | Nimbus Advertising Solutions Inc. | Programmatic advertising server |
US20220101402A1 (en) * | 2020-09-25 | 2022-03-31 | Content Square SAS | System and method for determining an attractiveness value of a product displayed on an online platform, and generating insights respective thereof |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP5589138B2 (en) | Bid price outlook tool | |
US20170098236A1 (en) | Exploration of real-time advertising decisions | |
US8224698B2 (en) | System and method for determining weighted average success probabilities of internet advertisements | |
US20080301033A1 (en) | Method and apparatus for optimizing long term revenues in online auctions | |
US20060122879A1 (en) | Method and system for pricing electronic advertisements | |
US20110173063A1 (en) | Advertiser value-based bid management in online advertising | |
US20090210287A1 (en) | Advertisement space allocation | |
US20090083098A1 (en) | System and method for an online auction with optimal reserve price | |
US20100070373A1 (en) | Auction System | |
US20080275775A1 (en) | System and method for using sampling for scheduling advertisements in an online auction | |
US20140089106A1 (en) | Method and system for formulating bids for internet advertising using forecast data | |
US20140006172A1 (en) | Method of calculating a reserve price for an auction and apparatus conducting the same | |
US20110264516A1 (en) | Limiting latency due to excessive demand in ad exchange | |
US20140297401A1 (en) | Shaping allocations in search advertising auctions | |
US8719096B2 (en) | System and method for generating a maximum utility slate of advertisements for online advertisement auctions | |
US20140006144A1 (en) | Method of calculating a reserve price for an auction and apparatus conducting the same | |
US20120078730A1 (en) | Automatic Internet Search Advertising Campaign Variable Optimization for Aiding Advertising Agency Efficiencies | |
US20110071908A1 (en) | Expressive bidding in online advertising auctions | |
US11010790B1 (en) | System and methods for using a revenue value index to score impressions for users for advertisement placement | |
US9558506B2 (en) | System and method for exploring new sponsored search listings of uncertain quality | |
US20100241486A1 (en) | Reducing revenue risk in advertisement allocation | |
US20110184803A1 (en) | Increasing Advertiser Utility in Broad Match Auctions | |
US20110071909A1 (en) | Expressive bidding online advertising auction mechanisms | |
US20140172587A1 (en) | Dynamic floor prices in second-price auctions | |
US20090254397A1 (en) | System and method for optimizing online keyword auctions subject to budget and estimated query volume constraints |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: YAHOO| INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BAX, ERIC;DONAMUKKALA, RAGHU;REEL/FRAME:030099/0107 Effective date: 20130327 |
|
AS | Assignment |
Owner name: EXCALIBUR IP, LLC, CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:YAHOO| INC.;REEL/FRAME:038383/0466 Effective date: 20160418 |
|
AS | Assignment |
Owner name: YAHOO| INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:EXCALIBUR IP, LLC;REEL/FRAME:038951/0295 Effective date: 20160531 |
|
AS | Assignment |
Owner name: EXCALIBUR IP, LLC, CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:YAHOO| INC.;REEL/FRAME:038950/0592 Effective date: 20160531 |
|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |