We study the power of ascending auctions in a scenario in which a seller is selling a collection of identical items to anonymous unit-demand bidders. We show that even with full knowledge of the set of bidders' private valuations for the items, if the bidders are ex-ante identical, no ascending auction can extract more than a constant times the revenue of the best fixed price scheme. This problem is equivalent to the problem of coming up with an optimal strategy for blowing up indistinguishable balloons with known capacities in order to maximize the amount of contained air. We show that the algorithm which simply inflates all balloons to a fixed volume is close to optimal in this setting. Collaborative Colleagues: Nicole Immorlica: colleagues Anna R. Karlin: colleagues Mohammad Mahdian: colleagues Kunal Talwar: colleagues The ACM Portal is published by the Association for Computing Machinery. Copyright © 2008 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player

Discrete mathematics in relation to computer science (msc 68Rxx)
Logistics (theme 3)
IEEE Computer Society
A. Sinclair
Annual IEEE Symposium on Foundations of Computer Science
Networks and Optimization

Immorlica, N.S, Karlin, A, Mahdian, M, & Talwar, K. (2007). Balloon popping with applications to ascending auctions. In A Sinclair (Ed.), Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (pp. 104–112). IEEE Computer Society.