Spectrum Auction Design
AbstractSpectrum auctions are used by governments to assign and price licenses for wireless communications. The standard approach is the simultaneous ascending auction, in which many related lots are auctioned simultaneously in a sequence of rounds. I analyze the strengths and weaknesses of the approach with examples from US spectrum auctions. I then present a variation-the combinatorial clock auction-which has been adopted by the UK and many other countries, which addresses many of the problems of the simultaneous ascending auction while building on its strengths. The combinatorial clock auction is a simple dynamic auction in which bidders bid on packages of lots. Most importantly, the auction allows alternative technologies that require the spectrum to be organized in different ways to compete in a technology-neutral auction. In addition, the pricing rule and information policy are carefully tailored to mitigate gaming behavior. An activity rule based on revealed preference promotes price and assignment discovery throughout the clock stage of the auction. Truthful bidding is encouraged, which simplifies bidding and improves efficiency. Experimental tests and early auctions confirm the advantages of the approach. Copyright Springer Science+Business Media New York 2013
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Springer in its journal Review of Industrial Organization.
Volume (Year): 42 (2013)
Issue (Month): 2 (March)
Contact details of provider:
Web page: http://www.springerlink.com/link.asp?id=100336
Auctions; Spectrum auctions; Market design; Package auction; Clock auction; Combinatorial auction; D44; C78; L96;
Other versions of this item:
- D44 - Microeconomics - - Market Structure and Pricing - - - Auctions
- C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
- L96 - Industrial Organization - - Industry Studies: Transportation and Utilities - - - Telecommunications
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Paul Klemperer & Aytek Erdil, 2009.
"A New Payment Rule for Core-Selecting Package Auctions,"
Economics Series Working Papers
2009-W11, University of Oxford, Department of Economics.
- 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.
- Erdil, Aytek & Klemperer, Paul, 2009. "A New Payment Rule for Core-Selecting Package Auctions," CEPR Discussion Papers 7487, C.E.P.R. Discussion Papers.
- Aytek Erdil & Paul Klemperer, 2009. "A New Payment Rule for Core-Selecting Package Auctions," Economics Papers 2009-W11, Economics Group, Nuffield College, University of Oxford.
- 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-85, August.
- Ingo Vogelsang, 2013. "The Endgame of Telecommunications Policy? A Survey," CESifo Working Paper Series 4545, CESifo Group Munich.
- Sano, Ryuji, 2012. "Non-bidding equilibrium in an ascending core-selecting auction," Games and Economic Behavior, Elsevier, vol. 74(2), pages 637-650.
- Sano, Ryuji, 2013. "Vickrey-reserve auctions and an equilibrium equivalence," Mathematical Social Sciences, Elsevier, vol. 65(2), pages 112-117.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F. Baum).
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.