On the Computational Power of Iterative Auctions II: Ascending Auctions
We embark on a systematic analysis of the power and limitations of iterative ascending-price combinatorial auctions. We prove a large number of results showing the boundaries of what can be achieved by different types of ascending auctions: item prices vs. bundle prices, anonymous prices vs. personalized prices, deterministic vs. non-deterministic, ascending vs. descending, preference elicitation vs. full elicitation, adaptive vs. non-adaptive, and single trajectory vs. multi trajectory. Two of our main results show that neither ascending item-price auctions nor ascending anonymous bundle-price auctions can determine the optimal allocation among general valuations. This justifies the use of personalized bundle prices in iterative combinatorial auctions like the FCC spectrum auctions.
|Date of creation:||Feb 2005|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.ratio.huji.ac.il/
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Rubinstein, Ariel, 1996. "Why Are Certain Properties of Binary Relations Relatively More Common in Natural Language?," Econometrica, Econometric Society, vol. 64(2), pages 343-55, March.
- MISHRA, Debasis & PARKES, David C., 2005.
"Ascending price Vickrey auctions for general valuations,"
CORE Discussion Papers
2005052, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Mishra, Debasis & Parkes, David C., 2007. "Ascending price Vickrey auctions for general valuations," Journal of Economic Theory, Elsevier, vol. 132(1), pages 335-366, January.
- Gul, Faruk & Stacchetti, Ennio, 2000. "The English Auction with Differentiated Commodities," Journal of Economic Theory, Elsevier, vol. 92(1), pages 66-95, May.
- Gabrielle Demange & Gale David & Marilda Sotomayor, 1986.
- Lawrence M. Ausubel & Paul Milgrom, 2002.
"Ascending Auctions with Package Bidding,"
02004, Stanford University, Department of Economics.
- Nisan, Noam & Segal, Ilya, 2006. "The communication requirements of efficient allocations and supporting prices," Journal of Economic Theory, Elsevier, vol. 129(1), pages 192-224, July.
- Babaioff, Moshe & Feldman, Michal & Nisan, Noam & Winter, Eyal, 2012. "Combinatorial agency," Journal of Economic Theory, Elsevier, vol. 147(3), pages 999-1034.
- Gul, Faruk & Stacchetti, Ennio, 1999. "Walrasian Equilibrium with Gross Substitutes," Journal of Economic Theory, Elsevier, vol. 87(1), pages 95-124, July.
- Lehmann, Benny & Lehmann, Daniel & Nisan, Noam, 2006. "Combinatorial auctions with decreasing marginal utilities," Games and Economic Behavior, Elsevier, vol. 55(2), pages 270-296, May.
- Liad Blumrosen & Noam Nisan, 2005. "On the Computational Power of Iterative Auctions I: Demand Queries," Discussion Paper Series dp381, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
When requesting a correction, please mention this item's handle: RePEc:huj:dispap:dp382. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ilan Nehama)
If references are entirely missing, you can add them using this form.