IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2203.11783.html
   My bibliography  Save this paper

The Combinatorial Multi-Round Ascending Auction

Author

Listed:
  • Bernhard Kasberger
  • Alexander Teytelboym

Abstract

The Combinatorial Multi-Round Ascending Auction (CMRA) is a new auction format that has already been used in several recent European spectrum auctions. We characterize ex-post equilibria that feature auction-specific forms of truthful bidding, demand expansion, and demand reduction for settings where bidders have either decreasing or non-decreasing marginal values. In particular, we show that the truthtelling equilibrium is fragile to small asymmetries in the bidders' caps. On the other hand, if bidders are sufficiently symmetric, the CMRA is vulnerable to risk-free collusion. We propose an alternative activity rule that prevents such collusive strategies but keeps the other equilibria intact. We discuss to what extent our theory is consistent with outcomes in Danish spectrum auctions and how our predictions can be tested using bidding data.

Suggested Citation

  • Bernhard Kasberger & Alexander Teytelboym, 2022. "The Combinatorial Multi-Round Ascending Auction," Papers 2203.11783, arXiv.org, revised Feb 2024.
    • Handle: RePEc:arx:papers:2203.11783
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2203.11783
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Sandro Brusco & Giuseppe Lopomo, 2002. "Collusion via Signalling in Simultaneous Ascending Bid Auctions with Heterogeneous Objects, with and without Complementarities," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 69(2), pages 407-436.
    2. Grimm, Veronika & Riedel, Frank & Wolfstetter, Elmar, 2003. "Low price equilibrium in multi-unit auctions: the GSM spectrum auction in Germany," International Journal of Industrial Organization, Elsevier, vol. 21(10), pages 1557-1569, December.
    3. Martin Bichler & Pasha Shabalin & Georg Ziegler, 2013. "Efficiency with Linear Prices? A Game-Theoretical and Computational Analysis of the Combinatorial Clock Auction," Information Systems Research, INFORMS, vol. 24(2), pages 394-417, June.
    4. 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.
    5. 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.
    6. Lawrence M. Ausubel & Peter Cramton & Marek Pycia & Marzena Rostek & Marek Weretka, 2014. "Demand Reduction and Inefficiency in Multi-Unit Auctions," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 81(4), pages 1366-1400.
    7. Janssen, Maarten & Karamychev, Vladimir, 2016. "Spiteful bidding and gaming in combinatorial clock auctions," Games and Economic Behavior, Elsevier, vol. 100(C), pages 186-207.
    8. Teytelboym, Alexander, 2014. "Gross substitutes and complements: A simple generalization," Economics Letters, Elsevier, vol. 123(2), pages 135-138.
    9. 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.
    10. Oleg Baranov & Christina Aperjis & Lawrence M. Ausubel & Thayer Morrill, 2017. "Efficient Procurement Auctions with Increasing Returns," American Economic Journal: Microeconomics, American Economic Association, vol. 9(3), pages 1-27, August.
    11. Ning Sun & Zaifu Yang, 2009. "A Double-Track Adjustment Process for Discrete Markets With Substitutes and Complements," Econometrica, Econometric Society, vol. 77(3), pages 933-952, May.
    12. 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.
    13. 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.
    14. Janssen, Maarten & Kasberger, Bernhard, 2019. "On the clock of the combinatorial clock auction," Theoretical Economics, Econometric Society, vol. 14(4), November.
    15. Jonathan Levin & Andrzej Skrzypacz, 2016. "Properties of the Combinatorial Clock Auction," American Economic Review, American Economic Association, vol. 106(9), pages 2528-2551, September.
    16. John H. Kagel & Yuanchuan Lien & Paul Milgrom, 2010. "Ascending Prices and Package Bidding: A Theoretical and Experimental Analysis," American Economic Journal: Microeconomics, American Economic Association, vol. 2(3), pages 160-185, August.
    17. Kagel, John H. & Lien, Yuanchuan & Milgrom, Paul, 2014. "Ascending prices and package bidding: Further experimental analysis," Games and Economic Behavior, Elsevier, vol. 85(C), pages 210-231.
    Full references (including those not matched with items on IDEAS)

    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. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    2. 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.
    3. 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.
    4. 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.
    5. Jim Ingebretsen Carlson, 2020. "A speedy auction using approximated bidders’ preferences," Annals of Operations Research, Springer, vol. 288(1), pages 65-93, May.
    6. Kazumori, Eiichiro & Belch, Yaakov, 2019. "t-Tree: The Tokyo toolbox for large-scale combinatorial auction experiments," Journal of Behavioral and Experimental Finance, Elsevier, vol. 24(C).
    7. Sun, Ning & Yang, Zaifu, 2016. "An Efficient and Strategy-Proof Double-Track Auction for Substitutes and Complements," Center for Mathematical Economics Working Papers 523, Center for Mathematical Economics, Bielefeld University.
    8. Satoru Fujishige & Zaifu Yang, 2015. "Decentralised Random Competitive Dynamic Market Processes," Discussion Papers 15/27, Department of Economics, University of York.
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. Elizabeth Baldwin & Paul Klemperer, 2019. "Understanding Preferences: “Demand Types”, and the Existence of Equilibrium With Indivisibilities," Econometrica, Econometric Society, vol. 87(3), pages 867-932, May.
    14. Lawrence M. Ausubel, 2006. "An Efficient Dynamic Auction for Heterogeneous Commodities," American Economic Review, American Economic Association, vol. 96(3), pages 602-629, June.
    15. Lawrence M. Ausubel & Paul Milgrom, 2004. "Ascending Proxy Auctions," Discussion Papers 03-035, Stanford Institute for Economic Policy Research.
    16. Peter Cramton, 2013. "Spectrum Auction Design," Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 42(2), pages 161-190, March.
    17. Committee, Nobel Prize, 2020. "Improvements to auction theory and inventions of new auction formats," Nobel Prize in Economics documents 2020-2, Nobel Prize Committee.
    18. Marszalec, Daniel, 2018. "Fear not the simplicity - An experimental analysis of auctions for complements," Journal of Economic Behavior & Organization, Elsevier, vol. 152(C), pages 81-97.
    19. Ingebretsen Carlson, Jim, 2016. "An Auction with Approximated Bidder Preferences - When an Auction has to be Quick," Working Papers 2016:12, Lund University, Department of Economics.
    20. Ning Sun & Zaifu Yang, 2016. "A Theory of Marriage with Mutually Consented Divorces," Discussion Papers 16/14, Department of Economics, University of York.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:arx:papers:2203.11783. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.