Skip to main content Accessibility help
×
Hostname: page-component-76fb5796d-9pm4c Total loading time: 0 Render date: 2024-04-26T11:00:21.364Z Has data issue: false hasContentIssue false

16 - Budget Constraints in Combinatorial Clock Auctions

from Part II - The Combinatorial Clock Auction Designs

Published online by Cambridge University Press:  26 October 2017

Maarten Janssen
Affiliation:
Department of Economics, University of Vienna and Higher School of Economics, Moscow
Vladimir A. Karamychev
Affiliation:
Department of Economics, Erasmus University and Tinbergen Institute
Bernhard Kasberger
Affiliation:
Department of Economics, University of Vienna
Martin Bichler
Affiliation:
Technische Universität München
Jacob K. Goeree
Affiliation:
University of New South Wales, Sydney
Get access

Summary

Introduction

Combinatorial Clock Auctions (CCAs) are multi-object auctions where bidders make package bids in a clock phase followed by a supplementary round. CCAs have been recently used around the world to allocate spectrum frequencies for mobile telecommunication purposes. CCAs were introduced by Ausubel et al. (2006) and are the subject of quite a few recent investigations (see, e.g., Ausubel and Baranov, 2014; Bichler et al., 2013; Janssen and Karamychev, 2016; Knapek and Wambach, 2012; Levin and Skrzypacz, 2016; and papers in this volume).

One of the issues that is under-explored in the literature on CCAs is the impact of budget constraints on the bidding behavior of participating bidders and, consequently, on the efficiency properties of the auction. It is difficult to obtain direct evidence of the fact that budget constraints play an important role in real-life CCAs. It is also difficult to believe, however, that bidders in recent spectrum auctions have not been financially constrained. The amount of money typically paid is in the billions of euros, and even though a firm may think it will earn that money back in the years after the auction, it is likely to have to borrow the money in one way or another. Also, casual empiricism suggests that share prices of companies participating in a long-lasting auction decline during and after the auction (cf. the share prices of KPN in the Netherlands in 2012 and A1 in Austria in 2013).

It can be useful to distinguish between hard and soft budget constraints. On one hand, a hard budget constraint implies that bidders cannot pay more than a certain exogenously determined amount of money. On the other hand, senior management can set a soft budget constraint and inform the company's bidding team that it is not allowed to spend more than a certain amount of money. That is, under soft budget constraints, senior management may set aside a certain amount of money to be invested in acquiring spectrum.

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, L.M. (2004). An efficient ascending-bid auction for multiple objects. American EconomicReview 94 (5):1452–1475.Google Scholar
Ausubel, L.M. and Baranov, O.V. (2014).Market design and the evolution of the combinatorial clock auction. American Economic Review: Papers & Proceedings, 104 (3):446–451.Google Scholar
Ausubel, L.M., Cramton, P., and Milgrom, P. (2006). The clock-proxy auction: A practical combinatorial auction design. In Cramton, P., Shoham, Y., and Steinberg, R., editors, CombinatorialAuctions. chapter 5. Cambridge, MA: MIT Press.
Ausubel, L.M. and Milgrom, P. (2002). Ascending auctions with package bidding. Frontiers of TheoreticalEconomics 1 (1):1534–1563.Google Scholar
Ausubel, L.M. and Milgrom, P. (2006). The lovely but lonely Vickrey auction. In Cramton, P., Shoham, Y., and Steinberg, R., editors, Combinatorial Auctions. Cambridge, MA: MIT Press.
Benoit, J.. and Krishna, V. (2001). Multiple-object auctions with budget constrained bidders. TheReview of Economic Studies 68 (1):155–179.Google Scholar
Bichler, M., Shabalin, P., andWolf, J. (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.Google Scholar
Brusco, S. and Lopomo, G. (2008). Budget constraints and demand reduction in simultaneous ascending-bid auctions. The Journal of Industrial Economics 56 (1):113–142.Google Scholar
Brusco, S. and Lopomo, G. (2009). Simultaneous ascending auctions with complementarities and known budget constraints. Economic Theory 38 (1):105–125.Google Scholar
Bulow, J., Levin, J., and Milgrom, P. (2009). Winning play in spectrum auctions. Working paper.CrossRef
Burkett, J. (2015). Endogenous budget constraints in auctions. Journal of Economic Theory 158:1–20.Google Scholar
Burkett, J. (2016). Optimally constraining a bidder using a simple budget. Theoretical Economics 11 (1):133–155.Google Scholar
Che, Y.-K. and Gale, I. (1998). Standard auctions with financially constrained bidders. The Review ofEconomic Studies 65 (1):1–21.Google Scholar
Cramton, P. (1995). Money out of thin air: the nationwide narrowband pcs auction. Journal of Economicsand Management Strategy 4 (2):267–343.Google Scholar
Dobzinski, S., Lavi, R., and Nisan, N. (2012). Multi-unit auctions with budget limits. Games andEconomic Behavior 74:486–503.Google Scholar
Fookes, N. and McKenzie, S. (2017). Impact of budget constraints on the efficiency of multi-lot spectrum auctions. In Bichler, M. and Goerer J.K., editors, Handbook of Spectrum AuctionDesign. Cambridge: Cambridge University Press.
Gretschko, V., Knapek, S., and Wambach, A. (2017). Bidding complexities in the combinatorial clock auction. In Bichler, M. and Goerer, J.K., editors, Handbook of Spectrum Auction Design. Cambridge: Cambridge University Press.
Janssen, M.C. W. and Karamychev, V.A. (2016). Gaming in combinatorial clock auctions. Gamesand Economic Behaviour 100:186–207.Google Scholar
Knapek, S. and Wambach, A. (2012). Strategic complexities in the combinatorial clock auction no. 3983. CESIFO Working Paper.
Krishna, V. (2010). Auction Theory, 2nd edn. Harlow, Essex: Academic Press.
Kroemer, C., Bichler, M., and Goetzendorff, A. (2017). (Un)expected bidder behavior in spectrum auctions: about inconsistent bidding and its impact on efficiency in the combinatorial clock auction.Group Decision and Negotiation, 25 (1):31–63.Google Scholar
Levin, J. and Skrzypacz, A. (2016). Properties of the combinatorial clock auction. American EconomicReview 106 (9):2528–2551.Google Scholar
Milgrom, P. (2004). Putting Auction Theory to Work, Cambridge: Cambridge University Press.
Salant, D. (1997). Up in the air: GTEs experience in the MTA auction for personal communication services licenses. Journal of Economics and Management Strategy 6 (3):549–572.Google 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
×