Advanced Search
MyIDEAS: Login to save this paper or follow this series

On the Computational Power of Iterative Auctions II: Ascending Auctions

Contents:

Author Info

  • Liad Blumrosen

    ()

  • Noam Nisan

    ()

Abstract

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.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://ratio.huji.ac.il/sites/default/files/publications/dp382.pdf
Download Restriction: no

Bibliographic Info

Paper provided by The Center for the Study of Rationality, Hebrew University, Jerusalem in its series Discussion Paper Series with number dp382.

as in new window
Length: 28 pages
Date of creation: Feb 2005
Date of revision:
Handle: RePEc:huj:dispap:dp382

Contact details of provider:
Postal: Feldman Building - Givat Ram - 91904 Jerusalem
Phone: +972-2-6584135
Fax: +972-2-6513681
Email:
Web page: http://www.ratio.huji.ac.il/
More information through EDIRC

Related research

Keywords:

This paper has been announced in the following NEP Reports:

References

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.:
as in new window
  1. Gul, Faruk & Stacchetti, Ennio, 2000. "The English Auction with Differentiated Commodities," Journal of Economic Theory, Elsevier, vol. 92(1), pages 66-95, May.
  2. Ausubel Lawrence M & Milgrom Paul R, 2002. "Ascending Auctions with Package Bidding," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 1(1), pages 1-44, August.
  3. 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.
  4. 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.
  5. Liad Blumrosen & Noam Nisan, 2005. "On the Computational Power of Iterative Auctions I: Demand Queries," Discussion Paper Series dp381, The Center for the Study of Rationality, Hebrew University, Jerusalem.
  6. Gul, Faruk & Stacchetti, Ennio, 1999. "Walrasian Equilibrium with Gross Substitutes," Journal of Economic Theory, Elsevier, vol. 87(1), pages 95-124, July.
  7. 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.
  8. Demange, Gabrielle & Gale, David & Sotomayor, Marilda, 1986. "Multi-Item Auctions," Journal of Political Economy, University of Chicago Press, vol. 94(4), pages 863-72, August.
  9. 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.
  10. Babaioff, Moshe & Feldman, Michal & Nisan, Noam & Winter, Eyal, 2012. "Combinatorial agency," Journal of Economic Theory, Elsevier, vol. 147(3), pages 999-1034.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Mu'alem, Ahuva & Nisan, Noam, 2008. "Truthful approximation mechanisms for restricted combinatorial auctions," Games and Economic Behavior, Elsevier, vol. 64(2), pages 612-631, November.
  2. Liad Blumrosen & Noam Nisan, 2005. "On the Computational Power of Iterative Auctions I: Demand Queries," Discussion Paper Series dp381, The Center for the Study of Rationality, Hebrew University, Jerusalem.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

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 you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.