Skip to main content Accessibility help
×
Home
  • Print publication year: 2017
  • Online publication date: October 2017

30 - Spectrum Auction Design: Simple Auctions For Complex Sales

from Part IV - Experimental Comparisons of Auction Designs

Summary

Introduction

The 1994 sale of radio spectrum for “personal communication services” (PCS) marked a sharp change in policy by the US Federal Communications Commission (FCC). Before turning to auctions the FCC had allocated valuable spectrum on the basis of comparative hearings (also known as “beauty contests”) and lotteries. Nobel laureate Ronald Coase long advocated that market-based mechanisms would improve the allocation of scarce spectrum resources, but his early insights were ignored for decades [1]. The PCS auction raised over six hundred million dollars for the US treasury and it was widely considered a success. Several authors discuss the advantages and disadvantages of auctions and beauty contests for allocating scarce spectrum [2, 3, 4]. For example, some argue that financially strong bidders might have advantages over weaker bidders in an auction, while others argue that with efficient capital markets such differences should be less of a concern. Nowadays, spectrum is predominantly assigned by auction, both in the US and elsewhere [5, 6], and in this paper we focus on questions of auction design.

The simultaneous multi-round auction (SMRA), which was designed for the US FCC in the early 90's has been the standard auction format for selling spectrum world wide for many years. It auctions multiple licenses for sale in parallel and uses simple activity rules which forces bidders to be active from the start. Despite the simplicity of its rules there can be considerable strategic complexity in the SMRA when there are synergies between licenses that cover adjacent geographic regions or between licenses in different frequency bands. Bidders who compete aggressively for a certain combination of licenses risk being exposed when they end up winning an inferior subset at high prices. When bidders rationally anticipate this exposure problem, competition will be suppressed with adverse consequences for the auction's performance. The exposure problem has led auction designers to consider combinatorial auctions, which enable bidders to express their preferences for an entire set of licenses directly. In fact, the design of spectrum auctions is seen as a pivotal problem im multi-object auction design and successful solutions are a likely role-model for other public or private sector auctions such as transportation or industrial procurement.

Since 2008, the combinatorial clock auction (CCA) has been used by regulators in various countries such as the Austria, Australia, Canada, Denmark, Ireland, the Netherlands, and Switzerland to sell spectrum.

[1] R. H., Coase, The federal communications commission, Journal of law and economics 2 (1959) 1–40.
[2] J., McMillan, Why auction the spectrum?, Telecommunications Policy 3 (19) 191–199.
[3] T., Valletti, Spectrum trading, Telecommunications Policy 25 (2001) 655–670.
[4] A., Morris, Spectrum auctions: Distortionary input tax or efficient revenue instrument?, Telecommunications Policy 29 (2005) 687–709.
[5] A., Gruenwald, Riding the us wave: spectrum auctions in the digital age, Telecommunications Policy 25 (2001) 719–728.
[6] R. S., Jain, Spectrum auctions in india: lessons from experience, Telecommunications Policy 25 (2001) 671–688.
[7] D., Porter, S., Rassenti, A., Roopnarine, V., Smith, Combinatorial auction design, Proceedings of the National Academy of Sciences of the United States of America (PNAS) 100 (2003) 11153–11157.
[8] C., Doyle, P., McShane, On the design and implementation of the GSM auction in Nigeria - the world's first ascending clock spectrum auction, Telecommunications Policy 27 (2003) 383–405.
[9] P., Cramton, Spectrum auction design, Review of Industrial Organization 42 (2013) 161–190.
[10] M., Bichler, P., Shabalin, J., Wolf, Do core-selecting combinatorial clock auctions always lead to high efficiency? An experimental analysis of spectrum auction designs, Experimental Economics 2013 1–35.
[11] N., Nisan, I., Segal, The communication complexity of efficient allocation problems, in: DIMACS workshop on Computational Issues in Game Theory and Mechanism Design, Minneapolis, MI, 2001.
[12] J., Goeree, Y., Lien, On the impossibility of core-selecting auctions, Theoretical Economics.
[13] R., Day, P., Milgrom, Core-selecting package auctions, International Journal of Game Theory 36 (2008) 393–407.
[14] N., Nisan, Bidding languages, in: P., Cramton, Y., Shoham, R., Steinberg (Eds.), Combinatorial Auctions, MIT Press, Cambridge, MA, 2006.
[15] M., Bichler, S., Schneider, K., Guler,M., Sayal, Compact bidding languages and supplier selection for markets with economies of scale and scope, European Journal on Operational Research 214 (2011) 67–77.
[16] T., Scheffel, A., Pikovsky, M., Bichler, K., Guler, An experimental comparison of linear and nonlinear price combinatorial auctions, Information Systems Research 22 (2011) 346–368.
[17] M., Bichler, P., Shabalin, G., Ziegler, Efficiency with linear prices? A theoretical and experimental analysis of the combinatorial clock auction, INFORMS Information Systems Research 24 (2013) 394–417.
[18] S., Datta, G., Satten, Rank-sum tests for clustered data, Journal of the American Statistical Association 100 (2005) 908–915.
[19] R., Earle, D., Sosa, Spectrum auctions around the world: An assessment of international experiences with auction restrictions, Tech. rep., AnalysisGroup (July 2013).