The FCC Spectrum Auctions: An Early Assessment

This paper analyzes six spectrum auctions conducted by the Federal Communications Commission from July 1994 to May 1996. These auctions were simultaneous multiple-round auctions in which collections of licenses were auctioned simultaneously. This auction form proved remarkably successful. Similar items sold for similar prices, and bidders successfully formed efficient aggregations of licenses. Bidding behavior differed substantially in the auctions. The extent of bidder competition and price uncertainty played an important role in determining behavior. Bidding credits and installment payments also played a major role in several of the auctions.     

Money Out of Thin Air: The nationwide Narrowband pcs Auction

The Federal Communications Commission held its first auction of radio spectrum at the Nationwide Narrowband PCS Auction in July 1994. The simultaneous multiple-round auction, which lasted five days, was an ascending bid auction in which all licenses were offered simultaneously. This paper describes the auction rules and how bidders prepared for the auction. The full history of bidding is presented. Several questions for auction theory are discussed. In the end, the government collected $617 million for ten licenses. The auction was viewed by all as a huge success an excellent example of bringing economic theory to bear on practical problems of allocating scarce resources.     

Spectrum Auction Design

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

Collusive Bidding: Lessons from the FCC Spectrum Auctions

The Federal Communications Commission (FCC) spectrum auctions use a simultaneous ascending auction design. Bidders bid on numerous communication licenses simultaneously, with bidding remaining open on all licenses until no bidder is willing to bid higher on any license. With full revelation of bidding information, simultaneous open bidding allows bidders to send messages to their rivals, telling them on which licenses to bid and which to avoid. These strategies can help bidders coordinate a division of the licenses, and enforce the proposed division by directed punishments. We examine solutions to mitigate collusive bidding in the spectrum auctions, and then apply these ideas to the design of daily electricity auctions.     

Fear of losing in a clock auction

We examine bidding behavior in a clock auction in which price is set by the lowest-accepted bid and provisional winners are reported each round (the LABpw auction). This format was used in the India 3G spectrum auction. In the standard theory, the auction performs poorly. In particular it yields lower revenues and is less efficient than the more standard clock auction with exit bids and highest-rejected-bid pricing (the HRB auction). However, the LABpw auction performs well in the lab, achieving higher revenues than the HRB auction. We show how fear of losing provides one motivation for the overbidding that causes higher revenues in the LABpw auction.     

Synergies in Wireless Telephony: Evidence from the Broadband PCS Auctions

We examine bid data from the first two broadband PCS spectrum auctions for evidence of value synergies. First, we estimate a benchmark regression for the determinants of final auction prices. Then, we include variables reflecting the extent to which bidders ultimately won or already owned the adjacent wireless properties. Consistent with geographic synergies in an ascending-bid auction, prices were higher when the highest losing bidder had adjacent licenses. The footprints of winning bidders suggest that they were often successful in realizing these synergies.     

Vickrey auctions with reserve pricing

Summary. We generalize the Vickrey auction to allow for reserve pricing in a multi-unit auction with interdependent values. In the Vickrey auction with reserve pricing, the seller determines the quantity to be made available as a function of the bidders' reports of private information, and then efficiently allocates this quantity among the bidders. Truthful bidding is a dominant strategy with private values and an ex post equilibrium with interdependent values. If the auction is followed by resale, then truthful bidding remains an equilibrium in the auction-plus-resale game. In settings with perfect resale, the Vickrey auction with reserve pricing maximizes seller revenues.Received: 31 December 2002, Revised: 5 May 2003, JEL Classification Numbers: D44, C78, D82.Correspondence to: Lawrence M. AusubelThe authors gratefully acknowledge the generous support of National Science Foundation Grants SES-97-31025, SES-01-12906 and IIS-02-05489. We appreciate valuable comments from Ilya Segal. Special thanks go to Mordecai Kurz, who served as Larry's dissertation advisor and who introduced both authors to the economics profession back at IMSSS at Stanford. Congratulations and best wishes are extended to Mordecai and his family on the happy occasion of the publication of Assets, Beliefs, and Equilibria in Economic Dynamics: Essays in Honor of Mordecai Kurz, in which this article also appears.     

Economics and Design of Capacity Markets for the Power Sector

Capacity markets are a means to assure resource adequacy. The need for a capacity market stems from several market failures the most prominent of which is the absence of a robust demand-side. Limited demand response makes market clearing problematic in times of scarcity. We present the economic motivation for a capacity market, present one specific market design that utilizes the best design features from various resource adequacy approaches analyzed in the literature, and we discuss other instruments to deal with the problems. We then discuss the suitability of the market for Europe and Germany in particular.     

Discrete clock auctions: an experimental study

We analyze the implications of different pricing rules in discrete clock auctions. The two most common pricing rules are highest-rejected bid (HRB) and lowest-accepted bid (LAB). Under HRB, the winners pay the lowest price that clears the market; under LAB, the winners pay the highest price that clears the market. In theory, both the HRB and LAB auctions maximize revenues and are fully efficient in our setting. Our experimental results indicate that the LAB auction achieves higher revenues. This revenue result may explain the frequent use of LAB pricing. On the other hand, HRB is successful in eliciting true values of the bidders both theoretically and experimentally.