IDEAS home Printed from https://ideas.repec.org/a/aea/aecrev/v104y2014i5p446-51.html
   My bibliography  Save this article

Market Design and the Evolution of the Combinatorial Clock Auction

Author

Listed:
  • Lawrence M. Ausubel
  • Oleg V. Baranov

Abstract

The Combinatorial Clock Auction (CCA) is an important recent innovation in auction design which has been adopted for many spectrum auctions worldwide. Since its inception, the CCA has been in almost continual evolution. We begin by reviewing some important changes which have already occurred. Despite these enhancements, we observe that the performance of the CCA is still limited by weak activity rules, suboptimal price feedback, and a missing-bid problem. We then describe further evolutionary changes, including new activity rules, new approaches to pricing, and an integration of non-mutually-exclusive bids, which will help to address these issues.

Suggested Citation

  • Lawrence M. Ausubel & Oleg V. Baranov, 2014. "Market Design and the Evolution of the Combinatorial Clock Auction," American Economic Review, American Economic Association, vol. 104(5), pages 446-451, May.
    • Handle: RePEc:aea:aecrev:v:104:y:2014:i:5:p:446-51
    Note: DOI: 10.1257/aer.104.5.446
    as

    Download full text from publisher

    File URL: http://www.aeaweb.org/articles.php?doi=10.1257/aer.104.5.446
    Download Restriction: no
    File URL: http://www.aeaweb.org/aer/ds/10405/P2014_1121_ds.zip
    Download Restriction: Access to full text is restricted to AEA members and institutional subscribers.
    ---><---

    References listed on IDEAS

    as
    1. Aytek Erdil & Paul Klemperer, 2010. "A New Payment Rule for Core-Selecting Package Auctions," Journal of the European Economic Association, MIT Press, vol. 8(2-3), pages 537-547, 04-05.
    2. Robert W. Day & Peter Cramton, 2012. "Quadratic Core-Selecting Payment Rules for Combinatorial Auctions," Operations Research, INFORMS, vol. 60(3), pages 588-603, June.
    3. Robert W. Day & S. Raghavan, 2007. "Fair Payments for Efficient Allocations in Public Sector Combinatorial Auctions," Management Science, INFORMS, vol. 53(9), pages 1389-1406, September.
    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. 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).
    2. Christian Kroemer & Martin Bichler & Andor Goetzendorff, 2016. "(Un)expected Bidder Behavior in Spectrum Auctions: About Inconsistent Bidding and Its Impact on Efficiency in the Combinatorial Clock Auction," Group Decision and Negotiation, Springer, vol. 25(1), pages 31-63, January.
    3. 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.
    4. Bó, Inácio & Hakimov, Rustamdjan, 2022. "The iterative deferred acceptance mechanism," Games and Economic Behavior, Elsevier, vol. 135(C), pages 411-433.
    5. Ryuji Sano, 2015. "Improving Efficiency Using Reserve Prices: An Equilibrium Analysis of Core-Selecting Auctions," KIER Working Papers 926, Kyoto University, Institute of Economic Research.
    6. Mochon, Asuncion & Saez, Yago, 2017. "A review of radio spectrum combinatorial clock auctions," Telecommunications Policy, Elsevier, vol. 41(5), pages 303-324.
    7. Heczko, Alexander & Kittsteiner, Thomas & Ott, Marion, 2018. "The Performance of Core-Selecting Auctions: An Experiment," EconStor Preprints 176842, ZBW - Leibniz Information Centre for Economics.
    8. Lawrence M. Ausubel & Oleg Baranov, 2020. "Revealed Preference And Activity Rules In Dynamic Auctions," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 61(2), pages 471-502, May.
    9. Janssen, Maarten & Karamychev, Vladimir, 2016. "Spiteful bidding and gaming in combinatorial clock auctions," Games and Economic Behavior, Elsevier, vol. 100(C), pages 186-207.
    10. Martin Bichler & Paul Milgrom & Gregor Schwarz, 2023. "Taming the Communication and Computation Complexity of Combinatorial Auctions: The FUEL Bid Language," Management Science, INFORMS, vol. 69(4), pages 2217-2238, April.
    11. Committee, Nobel Prize, 2020. "Improvements to auction theory and inventions of new auction formats," Nobel Prize in Economics documents 2020-2, Nobel Prize Committee.
    12. Blumrosen, Liad & Solan, Eilon, 2023. "Selling spectrum in the presence of shared networks: The case of the Israeli 5G auction," Telecommunications Policy, Elsevier, vol. 47(2).
    13. Ryuji Sano, 2018. "An equilibrium analysis of a core-selecting package auction with reserve prices," Review of Economic Design, Springer;Society for Economic Design, vol. 22(3), pages 101-122, December.
    14. Thomas Kittsteiner & Marion Ott & Richard Steinberg, 2022. "Competing Combinatorial Auctions," Information Systems Research, INFORMS, vol. 33(4), pages 1130-1137, December.

    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. Lamprirni Zarpala & Dimitris Voliotis, 2022. "A core-selecting auction for portfolio's packages," Papers 2206.11516, arXiv.org, revised Feb 2024.
    2. Benedikt Bünz & Benjamin Lubin & Sven Seuken, 2022. "Designing Core-Selecting Payment Rules: A Computational Search Approach," Information Systems Research, INFORMS, vol. 33(4), pages 1157-1173, December.
    3. Mochon, A. & Saez, Y. & Gomez-Barroso, J.L. & Isasi, P., 2012. "Exploring pricing rules in combinatorial sealed-bid auctions," Journal of Economic Behavior & Organization, Elsevier, vol. 82(2), pages 462-478.
    4. Peter Cramton, 2013. "Spectrum Auction Design," Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 42(2), pages 161-190, March.
    5. 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.
    6. , K. & ,, 2016. "On the impossibility of core-selecting auctions," Theoretical Economics, Econometric Society, vol. 11(1), January.
    7. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    8. Isa Hafalir & Hadi Yektaş, 2015. "Core deviation minimizing auctions," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(2), pages 367-376, May.
    9. Ott, Marion, 2019. "Simple Bayesian and Ex-Post Equilibria in Combinatorial Auctions," VfS Annual Conference 2019 (Leipzig): 30 Years after the Fall of the Berlin Wall - Democracy and Market Economy 203616, Verein für Socialpolitik / German Economic Association.
    10. 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.
    11. Mochon, Asuncion & Saez, Yago, 2017. "A review of radio spectrum combinatorial clock auctions," Telecommunications Policy, Elsevier, vol. 41(5), pages 303-324.
    12. Robert W. Day & Peter Cramton, 2012. "Quadratic Core-Selecting Payment Rules for Combinatorial Auctions," Operations Research, INFORMS, vol. 60(3), pages 588-603, June.
    13. Jonathan Levin & Andrzej Skrzypacz, 2016. "Properties of the Combinatorial Clock Auction," American Economic Review, American Economic Association, vol. 106(9), pages 2528-2551, September.
    14. Martin Bichler & Pasha Shabalin & Jürgen Wolf, 2013. "Do core-selecting Combinatorial Clock Auctions always lead to high efficiency? An experimental analysis of spectrum auction designs," Experimental Economics, Springer;Economic Science Association, vol. 16(4), pages 511-545, December.
    15. Aytek Erdil & Paul Klemperer, 2010. "A New Payment Rule for Core-Selecting Package Auctions," Journal of the European Economic Association, MIT Press, vol. 8(2-3), pages 537-547, 04-05.
    16. Andor Goetzendorff & Martin Bichler & Pasha Shabalin & Robert W. Day, 2015. "Compact Bid Languages and Core Pricing in Large Multi-item Auctions," Management Science, INFORMS, vol. 61(7), pages 1684-1703, July.
    17. Martin Bichler & Paul Milgrom & Gregor Schwarz, 2023. "Taming the Communication and Computation Complexity of Combinatorial Auctions: The FUEL Bid Language," Management Science, INFORMS, vol. 69(4), pages 2217-2238, April.
    18. Committee, Nobel Prize, 2020. "Improvements to auction theory and inventions of new auction formats," Nobel Prize in Economics documents 2020-2, Nobel Prize Committee.
    19. Janssen, Maarten & Karamychev, Vladimir, 2016. "Spiteful bidding and gaming in combinatorial clock auctions," Games and Economic Behavior, Elsevier, vol. 100(C), pages 186-207.
    20. Hitoshi Matsushima, 2011. "Efficient Combinatorial Exchanges," CIRJE F-Series CIRJE-F-826, CIRJE, Faculty of Economics, University of Tokyo.

    More about this item

    JEL classification:

    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions
    • D47 - Microeconomics - - Market Structure, Pricing, and Design - - - Market Design

    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:aea:aecrev:v:104:y:2014:i:5:p:446-51. 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: Michael P. Albert (email available below). General contact details of provider: https://edirc.repec.org/data/aeaaaea.html .

    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.