IDEAS home Printed from https://ideas.repec.org/a/eee/telpol/v38y2014i7p613-622.html
   My bibliography  Save this article

Spectrum auction design: Simple auctions for complex sales

Author

Listed:
  • Bichler, Martin
  • Goeree, Jacob
  • Mayer, Stefan
  • Shabalin, Pasha

Abstract

Following the successful PCS Auction conducted by the US Federal Communications Commission in 1994, auctions have replaced traditional ways of allocating valuable radio spectrum. Spectrum auctions have raised hundreds of billion dollars worldwide and have become a role model for market-based approaches in the public and private sectors. The PCS spectrum was sold via a simultaneous multi-round auction, which forces bidders to compete for licenses individually even though they typically value certain combinations. This exposes bidders to risk when they bid aggressively for a desired combination but end up winning an inferior subset. Foreseeing this possibility, bidders may act cautiously with adverse effects for revenue and efficiency. Combinatorial auctions allow for bids on combinations of licenses and thus hold the promise of improved performance. Recently, a number of countries worldwide have switched to the combinatorial clock auction to sell spectrum. This two-stage auction uses a core-selecting payment rule. The number of possible packages a bidder can submit grows exponentially with the number of licenses, which adds complexity to the auction. For larger auctions with dozens of licenses bidders cannot be expected to reveal all their valuations during such an auction. We analyze the impact of two main design choices on efficiency and revenue: simple “compact” bid languages versus complex “fully expressive” bid languages and simple “pay-as-bid” payment rules versus complex “core-selecting” payment rules. We consider these design choices both for ascending and sealed-bid formats. We find that simplicity of the bid language has a substantial positive impact on the auction׳s efficiency and simplicity of the payment rule has as a substantial positive impact on the auction׳s revenue. The currently popular combinatorial clock auction, which uses a complex bid language and payment rule, achieves the lowest efficiency and revenue among all treatment combinations.

Suggested Citation

  • Bichler, Martin & Goeree, Jacob & Mayer, Stefan & Shabalin, Pasha, 2014. "Spectrum auction design: Simple auctions for complex sales," Telecommunications Policy, Elsevier, vol. 38(7), pages 613-622.
    • Handle: RePEc:eee:telpol:v:38:y:2014:i:7:p:613-622
    DOI: 10.1016/j.telpol.2014.02.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0308596114000391
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.telpol.2014.02.004?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. 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.
    2. Peter Cramton, 2013. "Spectrum Auction Design," Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 42(2), pages 161-190, March.
    3. Valletti, Tommaso M., 0. "Spectrum trading," Telecommunications Policy, Elsevier, vol. 25(10-11), pages 655-670, October.
    4. Datta, Somnath & Satten, Glen A., 2005. "Rank-Sum Tests for Clustered Data," Journal of the American Statistical Association, American Statistical Association, vol. 100, pages 908-915, September.
    5. Bichler, Martin & Schneider, Stefan & Guler, Kemal & Sayal, Mehmet, 2011. "Compact bidding languages and supplier selection for markets with economies of scale and scope," European Journal of Operational Research, Elsevier, vol. 214(1), pages 67-77, October.
    6. Robert Day & Paul Milgrom, 2008. "Core-selecting package auctions," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 393-407, March.
    7. McMillan, John, 1995. "Why auction the spectrum?," Telecommunications Policy, Elsevier, vol. 19(3), pages 191-199, April.
    8. Jain, R. S., 0. "Spectrum auctions in India: lessons from experience," Telecommunications Policy, Elsevier, vol. 25(10-11), pages 671-688, October.
    9. Morris, Adele C., 0. "Spectrum auctions: Distortionary input tax or efficient revenue instrument?," Telecommunications Policy, Elsevier, vol. 29(9-10), pages 687-709, October.
    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. 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.
    3. Bichler, Martin & Gretschko, Vitali & Janssen, Maarten, 2017. "Bargaining in spectrum auctions: A review of the German auction in 2015," Telecommunications Policy, Elsevier, vol. 41(5), pages 325-340.
    4. 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.
    5. Blume, Andreas & Lai, Ernest K. & Lim, Wooyoung, 2023. "Mediated talk: An experiment," Journal of Economic Theory, Elsevier, vol. 208(C).
    6. 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.
    7. Jain, Rekha & Dara, Rishabh, 2017. "Framework for evolving spectrum management regimes: Lessons from India," Telecommunications Policy, Elsevier, vol. 41(5), pages 473-485.
    8. Bichler, Martin & Goeree, Jacob K., 2017. "Frontiers in spectrum auction design," International Journal of Industrial Organization, Elsevier, vol. 50(C), pages 372-391.
    9. Martin Bichler & Vladimir Fux & Jacob Goeree, 2018. "A Matter of Equality: Linear Pricing in Combinatorial Exchanges," Information Systems Research, INFORMS, vol. 29(4), pages 1024-1043, December.
    10. Filiz-Ozbay, Emel & Lopez-Vargas, Kristian & Ozbay, Erkut Y., 2015. "Multi-object auctions with resale: Theory and experiment," Games and Economic Behavior, Elsevier, vol. 89(C), pages 1-16.

    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. Mochon, Asuncion & Saez, Yago, 2017. "A review of radio spectrum combinatorial clock auctions," Telecommunications Policy, Elsevier, vol. 41(5), pages 303-324.
    2. 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.
    3. Janssen, Maarten & Karamychev, Vladimir, 2016. "Spiteful bidding and gaming in combinatorial clock auctions," Games and Economic Behavior, Elsevier, vol. 100(C), pages 186-207.
    4. Janssen, Maarten & Kasberger, Bernhard, 2019. "On the clock of the combinatorial clock auction," Theoretical Economics, Econometric Society, vol. 14(4), November.
    5. Vogelsang Ingo, 2013. "The Endgame of Telecommunications Policy? A Survey," Review of Economics, De Gruyter, vol. 64(3), pages 193-270, December.
    6. Janssen, Maarten & Kasberger, Bernhard, 2019. "On the clock of the combinatorial clock auction," Theoretical Economics, Econometric Society, vol. 14(4).
    7. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    8. Maarten Janssen & Vladimir Karamychev, 2013. "Gaming in Combinatorial Clock Auctions," Tinbergen Institute Discussion Papers 13-027/VII, Tinbergen Institute, revised 16 Dec 2013.
    9. Heczko, Alexander & Kittsteiner, Thomas & Ott, Marion, 2018. "The Performance of Core-Selecting Auctions: An Experiment," EconStor Preprints 176842, ZBW - Leibniz Information Centre for Economics.
    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. Lamprirni Zarpala & Dimitris Voliotis, 2022. "A core-selecting auction for portfolio's packages," Papers 2206.11516, arXiv.org, revised Feb 2024.
    12. 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.
    13. 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.
    14. 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.
    15. Fulvio Minervini & Diego Piacentino, 2007. "Spectrum Management and Regulation: Towards a Full-Fledged Market for Spectrum Bands?," Working Papers 07-2007, Macerata University, Department of Studies on Economic Development (DiSSE), revised Nov 2008.
    16. Marsden, Richard & Ihle, Hans-Martin, 2018. "Mechanisms to incentivise shared-use of spectrum," Telecommunications Policy, Elsevier, vol. 42(4), pages 315-322.
    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. Kemal Guler & Martin Bichler & Ioannis Petrakis, 2016. "Ascending Combinatorial Auctions with Risk Averse Bidders," Group Decision and Negotiation, Springer, vol. 25(3), pages 609-639, May.
    19. 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).
    20. 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.

    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:telpol:v:38:y:2014:i:7:p:613-622. 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/wps/find/journaldescription.cws_home/30471/description#description .

    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.