Skip to main content Accessibility help
×
Hostname: page-component-76fb5796d-zzh7m Total loading time: 0 Render date: 2024-04-29T23:23:58.072Z Has data issue: false hasContentIssue false

9 - Market Design and the Evolution of the Combinatorial Clock Auction

from Part II - The Combinatorial Clock Auction Designs

Published online by Cambridge University Press:  26 October 2017

Lawrence M. Ausubel
Affiliation:
Department of Economics, University of Maryland
Oleg Baranov
Affiliation:
Department of Economics, University of Colorado Boulder
Martin Bichler
Affiliation:
Technische Universität München
Jacob K. Goeree
Affiliation:
University of New South Wales, Sydney
Get access

Summary

The combinatorial clock auction (CCA) is an important recent innovation in market design. It has progressed rapidly from a 2003 academic paper to real-world adoption. In the past few years, it has been used for more major spectrum auctions worldwide than any other auction format. As such, the CCA is the first format that has the potential to eclipse the simultaneous multiple-round auction (SMRA) as the standard for spectrum auctions.

The defining characteristic of the CCA is a two-stage bidding process. The first stage is a dynamic clock auction: the auctioneer announces prices for the items in the auction; and bidders respond with quantities desired at the announced prices. Bidding in this stage progresses in multiple rounds as prices increase until aggregate demand is less than or equal to supply for every item. In the second stage, bidders have the opportunity to submit a multiplicity of supplementary bids, both to improve upon their bids from the clock rounds and to express values for other packages.

Following the second stage, the bids from both the clock rounds and the supplementary round are entered into winner determination and pricing problems. The winner determination problem treats these bids as package bids, and determines the value maximizing allocation of the items among the bidders. The pricing problem is based on second-price principles.

In most applications, there is also a third stage of bidding. Generally, several items in the auction are treated as identical during the first two stages. For example, in the European digital dividend auctions, there have generally been six distinct licenses offered in the 800 MHz band. In the auction's first two stages, bidders simply indicate quantities of “generic” 800 MHz spectrum that they wish to purchase. The third stage takes bidders’ winnings of generic spectrum as given, and bidders express values for specific 800 MHz licenses. Thus, it determines the assignment from generic spectrum to physical frequencies.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2017

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Ausubel, Lawrence M., and Oleg V., Baranov. 2013. “Core-Selecting Auctions with Incomplete Information.” Unpublished.
Ausubel, Lawrence M., and Oleg V., Baranov. 2014. “The Combinatorial Clock Auction, Revealed Preference and Iterative Pricing.” Unpublished.
Ausubel, Lawrence M., Peter, Cramton, and Paul, Milgrom. 2006. “The Clock-Proxy Auction: A Practical Combinatorial Auction Design.” In Combinatorial Auctions, edited by Peter, Cramton, Yoav, Shoham, and Richard, Steinberg, 115–38. Cambridge, MA: MIT Press.
Ausubel, Lawrence M., and Paul R., Milgrom. 2002. “Ascending Auctions with Package Bidding.” Frontiers of Theoretical Economics 1 (1).Google Scholar
Cramton, Peter. 2013. “Spectrum Auction Design.” Review of Industrial Organization 42(2): 161–90.CrossRefGoogle Scholar
Day, Robert W., and Peter, Cramton. 2012. “Quadratic Core-Selecting Payment Rules for Combinatorial Auctions.” Operations Research 60 (3): 588–603.CrossRefGoogle Scholar
Day, Robert, and Paul, Milgrom. 2008. “Core-Selecting Package Auctions.” International Journalof Game Theory 36 (3–4): 393–407.Google Scholar
Day, RobertW., and S., Raghavan. 2007. “Fair Payments for Efficient Allocations in Public Sector Combinatorial Auctions.” Management Science 53 (9): 1389–1406.CrossRefGoogle Scholar
Erdil, Aytek, and Paul, Klemperer. 2010. “A New Payment Rule for Core-Selecting Package Auctions.” Journal of the European Economic Association 8 (2–3): 537–47.Google Scholar
Nisan, Noam. 2006. “Bidding Languages for Combinatorial Auctions.” In Combinatorial Auctions, edited by Peter, Cramton, Yoav, Shoharn, and Richard, Steinberg, 215–31. Cambridge, MA: MIT Press.
Parkes, David C. 2001. “Iterative Combinatorial Auctions: Achieving Economic and Computational Efficiency.” PhD diss., University of Pennsylvania.

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×