Abstract

 
 

References (37)



 
 

Citations (4)



 


 



Spectrum Auction Design


Peter Cramton


University of Maryland - Department of Economics

August 15, 2009

TPRC 2009

Abstract:     
Spectrum 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 package clock auction, adopted by the UK, which addresses many of the problems of the simultaneous ascending auction while building on its strengths.

The package 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.

Number of Pages in PDF File: 30

Keywords: auctions, spectrum auctions, market design, package auction, clock auction, combinatorial auction

JEL Classification: D44, C78, L96

Accepted Paper Series


Download This Paper

Date posted: February 6, 2012  

Suggested Citation

Cramton, Peter C., Spectrum Auction Design (August 15, 2009). TPRC 2009. Available at SSRN: http://ssrn.com/abstract=1999832

Contact Information

Peter C. Cramton (Contact Author)
University of Maryland - Department of Economics ( email )
College Park, MD 20742
United States
301-405-6987 (Phone)
301-405-3542 (Fax)
Feedback to SSRN (Beta)


Paper statistics
Abstract Views: 164
Downloads: 23
References:  37
Citations:  4

© 2013 Social Science Electronic Publishing, Inc. All Rights Reserved.  FAQ   Terms of Use   Privacy Policy   Copyright
This page was processed by apollo4 in 0.406 seconds