Skip to main content Accessibility help
×
Hostname: page-component-8448b6f56d-xtgtn Total loading time: 0 Render date: 2024-04-23T16:25:12.543Z Has data issue: false hasContentIssue false

15 - Properties of the Combinatorial Clock Auction

from Part II - The Combinatorial Clock Auction Designs

Published online by Cambridge University Press:  26 October 2017

Jonathan Levin
Affiliation:
Graduate School of Business, Stanford University
Andrzej Skrzypacz
Affiliation:
Graduate School of Business, Stanford University
Martin Bichler
Affiliation:
Technische Universität München
Jacob K. Goeree
Affiliation:
University of New South Wales, Sydney
Get access

Summary

In this paper we study some properties of a new auction design, the combinatorial clock auction (or CCA). The CCA was proposed by Ausubel, Cramton and Milgrom (2006). It is essentially a dynamic Vickrey auction. The Vickrey auction is central to economic theory as the unique auction that provides truthful incentives while achieving an efficient allocation. Yet it is often viewed as impractical for real-world applications because it requires bidders to submit bids for many possible packages of items. Economists think of dynamic auctions as having an advantage in this regard because bidders can discover gradually how their demands fit together — what Paul Milgrom has called the “package discovery” problem.

The CCA combines an initial clock phase, during which prices rise and bidders state their demands in response to the current prices, with a final round in which bidders submit sealed package bids. The seller uses the final bids to compute the highest value allocation and the corresponding Vickrey payments. Ideally, bidders demand their most desired package at every stated price in the clock phase, allowing for information revelation. Then in the final round, they bid their true preferences, leading to an efficient allocation with truthfulVickrey prices. The question we address is whether this is the likely equilibrium outcome of the CCA; that is, whether the desirable incentive properties of the Vickrey auction are retained.

The practical motivation for our study is the recent and widespread adoption of CCA bidding to sell radio spectrum licenses. Spectrum auctions have provided the motivation for some important recent innovations in auction design, starting with the simultaneous ascending auction pioneered by the FCC in the early 1990s and subsequently adopted in many other countries (Klemperer, 2004; Milgrom, 2004). The FCC design allows for gradual information revelation, but it does not easily accommodate package bidding, and it creates incentives for demand reduction because winners pay their bids (Cramton, 2013). In principle, the CCA addresses both of these issues.

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, LawrenceM. 2004. “An Efficient Ascending-Bid Auction for Multiple Objects.” AmericanEconomic Review 94(5): 1452–1475.CrossRefGoogle Scholar
Ausubel, Lawrence M. and Oleg, Baranov. 2010. “Core-Selecting Auctions with Incomplete Information.” University of Maryland Working Paper.
Ausubel, Lawrence M. and Oleg, Baranov. 2013. “An Enhanced Combinatorial Clock Auction.” University of Maryland Working Paper.
Ausubel, Lawrence M. and Peter, Cramton. 2011. “Activity Rules for the Combinatorial Clock Auction.” University of Maryland Working Paper.
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–138, MIT Press.
Ausubel, Lawrence M., Peter, Cramton, Marek, Pycia, Marzena, Rostek and Marek, Weretka. 2014. “Demand Reduction and Inefficiency in Multi-Unit Auctions.” Review of Economic Studies 81(4): 1366–1400.CrossRefGoogle Scholar
Ausubel, Lawrence M. and Paul, Milgrom. 2002. “Ascending Auctions with Package Bidding.” Frontiers of Theoretical Economics 1(1): Article 1.Google Scholar
Ausubel, Lawrence M. and Paul, Milgrom. 2006. “The Lovely but Lonely Vickrey Auction.” In Combinatorial Auctions, edited by Peter, Cramton, Yoav, Shoham and Richard, Steinberg, 17–40, MIT Press.
Beck, Marissa and Marion, Ott. 2013. “Incentives for Overbidding in Minimum-Revenue Core- Selecting Auctions.” Stanford University Working Paper.
Bichler, Martin, Pasha, Shabalin, and Jurgen, Wolf. 2013. “Do Core-Selecting Combinatorial Clock Auctions Always Lead to High Efficiency? An Experimental Analysis of Spectrum Auction Designs.” Experimental Economics 16(4): 511–545.CrossRefGoogle Scholar
Bulow, Jeremy, Jonathan, Levin and Paul, Milgrom. 2009. “Winning Play in Spectrum Auctions,” Stanford University Working Paper.
Cramton, Peter. 2008a. “A Review of the 10–40 GHz Auction.” Office of Communications, United Kingdom.
Cramton, Peter. 2008b. “A Review of the L Band Auction.” Office of Communications, United Kingdom.
Cramton, Peter. 2013. “Spectrum Auction Design.” Review of Industrial Organization 42(2): 161–190.CrossRefGoogle Scholar
Day, Robert and Paul, Milgrom. 2008. “Core-Selecting Package Auctions,” International Journalof Game Theory 36: 393–407.Google Scholar
Day, Robert. and S., Raghavan. 2008. “Fair Payments for Efficient Allocations in Public Sector Combinatorial Auctions,” Management Science 53: 1389–1406.Google Scholar
Erdil, Aytek and Paul, Klemperer. 2009. “A New Payment Rule for Core-Selecting Auctions.” Journalof the European Economic Association 8: 537–547.CrossRefGoogle Scholar
Goeree, Jacob and Yuanchuan, Lien. 2016. “On the Impossibility of Core-Selecting Auctions.” Theoretical Economics 11: 41–52.CrossRefGoogle Scholar
Janssen, Maarten and Vladimir, Karamychev. 2013. “Gaming in Combinatorial Clock Auctions,” Tinbergen Institute Discussion Paper 13–027/VII.
Janssen, Maarten and Bernhard, Kasberger. 2015. “On the Clock of the Combinatorial Clock Auction.” University of Vienna Working Paper.
Jewitt, Ian and Zhiyun, Li. 2008. “Report on the 2008 UK 10–40 GHz Spectrum Auction.” Office of Communications, United Kingdom.
Klemperer, Paul. 2004. Auctions: Theory and Practice. Princeton University Press.
Knapek, Stephan and AchimWambach. 2012. “Strategic Complexities in the Combinatorial Clock Auction.” CESifo Working Paper 3983.
Kyle, Albert S. 1989. “Informed Speculation With Imperfect Competition.” Review of EconomicStudies 56(3): 317–355.CrossRefGoogle Scholar
Loertscher, Simon, Leslie, Marx and Tom, Wilkening. 2015. “A Long Way Coming: Designing Centralized Markets with Privately Informed Buyers and Sellers.” Journal of Economic Literature 53(4): 857–897.CrossRefGoogle Scholar
Milgrom, Paul. 2004. Putting Auction Theory to Work. Cambridge University Press.
Milgrom, Paul. 2007. “Package Auctions and Exchanges.” Econometrica 75: 935–965.CrossRefGoogle Scholar
Morgan, John, Ken, Steiglitz and George, Reis. 2003. “The Spite Motive and Equilibrium Behavior in Auctions.” Contributions to Economic Analysis & Policy 2(1): Article 5.Google Scholar
Riedel, Frank and Elmar, Wolfstetter. 2006. “Immediate Demand Reduction in Simultaneous Ascending-Bid Auctions: A Uniqueness Result.” Economic Theory 29(3): 721–726.CrossRefGoogle Scholar
Salant, David. 2014. A Primer on Auction Design, Management, and Strategy. MIT Press.
Vives, Xavier. 2011. “Strategic Supply Function CompetitionWith Private Information.” Econometrica, 79: 1919–1966.CrossRefGoogle Scholar

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
×