IDEAS home Printed from https://ideas.repec.org/a/eee/jetheo/v145y2010i3p1203-1223.html
   My bibliography  Save this article

Informational limitations of ascending combinatorial auctions

Author

Listed:
  • Blumrosen, Liad
  • Nisan, Noam

Abstract

We study the inherent limitations of natural widely-used classes of ascending combinatorial auctions. Specifically, we show that ascending combinatorial auctions that do not use both non-linear prices and personalized prices cannot achieve social efficiency with general bidder valuations. We also show that the loss of efficiency can be severe and that only a diminishing fraction of the social welfare may be captured. This justifies the added complexity in the auctions suggested by, e.g., Parkes and Ungar (2000) [29] and Ausubel and Milgrom (2002) [2].

Suggested Citation

  • Blumrosen, Liad & Nisan, Noam, 2010. "Informational limitations of ascending combinatorial auctions," Journal of Economic Theory, Elsevier, vol. 145(3), pages 1203-1223, May.
    • Handle: RePEc:eee:jetheo:v:145:y:2010:i:3:p:1203-1223
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0022-0531(09)00128-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Paul Milgrom, 2000. "Putting Auction Theory to Work: The Simultaneous Ascending Auction," Journal of Political Economy, University of Chicago Press, vol. 108(2), pages 245-272, April.
    2. Frank Kelly & Richard Steinberg, 2000. "A Combinatorial Auction with Multiple Winners for Universal Service," Management Science, INFORMS, vol. 46(4), pages 586-596, April.
    3. Yossi Sheffi, 2004. "Combinatorial Auctions in the Procurement of Transportation Services," Interfaces, INFORMS, vol. 34(4), pages 245-252, August.
    4. John O. Ledyard & Mark Olson & David Porter & Joseph A. Swanson & David P. Torma, 2002. "The First Use of a Combined-Value Auction for Transportation Services," Interfaces, INFORMS, vol. 32(5), pages 4-12, October.
    5. 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.
    6. Cramton, Peter, 1998. "Ascending auctions," European Economic Review, Elsevier, vol. 42(3-5), pages 745-756, May.
    7. Bikhchandani, Sushil & Ostroy, Joseph M., 2002. "The Package Assignment Model," Journal of Economic Theory, Elsevier, vol. 107(2), pages 377-406, December.
    8. Gul, Faruk & Stacchetti, Ennio, 2000. "The English Auction with Differentiated Commodities," Journal of Economic Theory, Elsevier, vol. 92(1), pages 66-95, May.
    9. Lawrence M. Ausubel & Peter Cramton & R. Preston McAfee & John McMillan, 1997. "Synergies in Wireless Telephony: Evidence from the Broadband PCS Auctions," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 6(3), pages 497-527, September.
    10. Gul, Faruk & Stacchetti, Ennio, 1999. "Walrasian Equilibrium with Gross Substitutes," Journal of Economic Theory, Elsevier, vol. 87(1), pages 95-124, July.
    11. 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.
    12. Milgrom,Paul, 2004. "Putting Auction Theory to Work," Cambridge Books, Cambridge University Press, number 9780521536721, January.
    13. Demange, Gabrielle & Gale, David & Sotomayor, Marilda, 1986. "Multi-Item Auctions," Journal of Political Economy, University of Chicago Press, vol. 94(4), pages 863-872, August.
    14. Milgrom, Paul R & Weber, Robert J, 1982. "A Theory of Auctions and Competitive Bidding," Econometrica, Econometric Society, vol. 50(5), pages 1089-1122, September.
    15. Lawrence M. Ausubel, 2006. "An Efficient Dynamic Auction for Heterogeneous Commodities," American Economic Review, American Economic Association, vol. 96(3), pages 602-629, June.
    16. Rothkopf, Michael H & Teisberg, Thomas J & Kahn, Edward P, 1990. "Why Are Vickrey Auctions Rare?," Journal of Political Economy, University of Chicago Press, vol. 98(1), pages 94-109, February.
    17. Bikhchandani, Sushil & Mamer, John W., 1997. "Competitive Equilibrium in an Exchange Economy with Indivisibilities," Journal of Economic Theory, Elsevier, vol. 74(2), pages 385-413, June.
    18. Kelso, Alexander S, Jr & Crawford, Vincent P, 1982. "Job Matching, Coalition Formation, and Gross Substitutes," Econometrica, Econometric Society, vol. 50(6), pages 1483-1504, November.
    19. 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.
    20. S.J. Rassenti & V.L. Smith & R.L. Bulfin, 1982. "A Combinatorial Auction Mechanism for Airport Time Slot Allocation," Bell Journal of Economics, The RAND Corporation, vol. 13(2), pages 402-417, Autumn.
    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


    Cited by:

    1. Perennes, Patricia, 2014. "Use of combinatorial auctions in the railway industry: Can the “invisible hand” draw the railway timetable?," Transportation Research Part A: Policy and Practice, Elsevier, vol. 67(C), pages 175-187.
    2. Dughmi, Shaddin & Vondrák, Jan, 2015. "Limitations of randomized mechanisms for combinatorial auctions," Games and Economic Behavior, Elsevier, vol. 92(C), pages 370-400.
    3. Paul Dütting & Vasilis Gkatzelis & Tim Roughgarden, 2017. "The Performance of Deferred-Acceptance Auctions," Mathematics of Operations Research, INFORMS, vol. 42(4), pages 897-914, November.
    4. Lavi, Ron & Oren, Sigal, 2012. "Side-communication yields efficiency of ascending auctions: The two-items case," Games and Economic Behavior, Elsevier, vol. 76(2), pages 439-456.
    5. Oren Ben-Zwi & Ilan Newman, 2023. "No Ascending Auction can find Equilibrium for SubModular valuations," Papers 2312.00522, arXiv.org.
    6. Ben-Zwi, Oren, 2017. "Walrasian's characterization and a universal ascending auction," Games and Economic Behavior, Elsevier, vol. 104(C), pages 456-467.
    7. Babaioff, Moshe & Blumrosen, Liad & Schapira, Michael, 2013. "The communication burden of payment determination," Games and Economic Behavior, Elsevier, vol. 77(1), pages 153-167.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.
    2. Satoru Fujishige & Zaifu Yang, 2020. "A Universal Dynamic Auction for Unimodular Demand Types: An Efficient Auction Design for Various Kinds of Indivisible Commodities," Discussion Papers 20/08, Department of Economics, University of York.
    3. Ozan Candogan & Asuman Ozdaglar & Pablo A. Parrilo, 2015. "Iterative Auction Design for Tree Valuations," Operations Research, INFORMS, vol. 63(4), pages 751-771, August.
    4. Lawrence M. Ausubel, 2006. "An Efficient Dynamic Auction for Heterogeneous Commodities," American Economic Review, American Economic Association, vol. 96(3), pages 602-629, June.
    5. Lawrence M. Ausubel & Paul Milgrom, 2004. "Ascending Proxy Auctions," Discussion Papers 03-035, Stanford Institute for Economic Policy Research.
    6. Lawrence M. Ausubel & Peter Cramton & Paul Milgrom, 2012. "System and Method for a Hybrid Clock and Proxy Auction," Papers of Peter Cramton 12acmhc, University of Maryland, Department of Economics - Peter Cramton, revised 2012.
    7. Ning Sun & Zaifu Yang, 2014. "An Efficient and Incentive Compatible Dynamic Auction for Multiple Complements," Journal of Political Economy, University of Chicago Press, vol. 122(2), pages 422-466.
    8. Ning Sun & Zaifu Yang, 2008. "A Double-Track Auction for Substitutes and Complements," KIER Working Papers 656, Kyoto University, Institute of Economic Research.
    9. 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.
    10. Kazuo Murota, 2016. "Discrete convex analysis: A tool for economics and game theory," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 151-273, December.
    11. Alexander Teytelboym & Shengwu Li & Scott Duke Kominers & Mohammad Akbarpour & Piotr Dworczak, 2021. "Discovering Auctions: Contributions of Paul Milgrom and Robert Wilson," Scandinavian Journal of Economics, Wiley Blackwell, vol. 123(3), pages 709-750, July.
    12. Lawrence M. Ausubel & Peter Cramton & Wynne P. Jones, 2012. "System and Method for an Auction of Multiple Types of Items," Papers of Peter Cramton 11acjam, University of Maryland, Department of Economics - Peter Cramton, revised 2012.
    13. 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.
    14. Dries R. Goossens & Rudolf Müller & Frits C. R. Spieksma, 2010. "Algorithms for Recognizing Economic Properties in Matrix Bid Combinatorial Auctions," INFORMS Journal on Computing, INFORMS, vol. 22(3), pages 339-352, August.
    15. Laurent Lamy, 2009. "Ascending auctions: some impossibility results and their resolutions with final price discounts," PSE Working Papers halshs-00575076, HAL.
    16. Satoru Fujishige & Zaifu Yang, 2017. "On a spontaneous decentralized market process," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 2(1), pages 1-37, December.
    17. A. Talman & Zaifu Yang, 2015. "An efficient multi-item dynamic auction with budget constrained bidders," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 769-784, August.
    18. Gerard van der Laan & Zaifu Yang, 2016. "An ascending multi-item auction with financially constrained bidders," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 109-149, December.
    19. Paul Milgrom, 2009. "Assignment Messages and Exchanges," American Economic Journal: Microeconomics, American Economic Association, vol. 1(2), pages 95-113, August.
    20. John William Hatfield & Paul R. Milgrom, 2005. "Matching with Contracts," American Economic Review, American Economic Association, vol. 95(4), pages 913-935, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:145:y:2010:i:3:p:1203-1223. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622869 .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.