Abstract
We study auctions for selling a limited supply of a single commodity in the case where the supply is known in advance and the case it is unknown and must be instead allocated in an online fashion. The latter variant was proposed by Mahdian and Saberi [12] as a model of an important phenomena in auctions for selling Internet advertising: advertising impressions must be allocated as they arrive and the total quantity available is unknown in advance. We describe the Bayesian optimal mechanism for these variants and extend the random sampling auction of Goldberg et al. [8] to address the prior-free case.
Original language | English (US) |
---|---|
Title of host publication | EC'09 - Proceedings of the 2009 ACM Conference on Electronic Commerce |
Pages | 41-49 |
Number of pages | 9 |
DOIs | |
State | Published - Dec 1 2009 |
Event | 2009 ACM Conference on Electronic Commerce, EC'09 - Stanford, CA, United States Duration: Jul 6 2009 → Jul 10 2009 |
Publication series
Name | Proceedings of the ACM Conference on Electronic Commerce |
---|
Other
Other | 2009 ACM Conference on Electronic Commerce, EC'09 |
---|---|
Country | United States |
City | Stanford, CA |
Period | 7/6/09 → 7/10/09 |
Keywords
- Auction
- Limited supply
- Mechanism design
- Online
- Prior-free
ASJC Scopus subject areas
- Software
- Computer Science Applications
- Computer Networks and Communications