Group Decision and Negotiation

, Volume 25, Issue 1, pp 31–63 | Cite as

(Un)expected Bidder Behavior in Spectrum Auctions: About Inconsistent Bidding and Its Impact on Efficiency in the Combinatorial Clock Auction

  • Christian Kroemer
  • Martin Bichler
  • Andor Goetzendorff
Article

Abstract

The combinatorial clock auction is a two-stage auction format, which has been used to sell spectrum licenses worldwide in the recent years. It draws on a number of elegant ideas inspired by economic theory. A revealed preference activity rule should provide incentives to bid straightforward, i.e., consistent with the bidders’ valuations on a payoff-maximizing package, in each round of the clock phase. A second-price rule should set incentives to bid truthfully in both phases. If bidders respond to these incentives and bid straightforward in the clock phase and truthful in the second sealed-bid stage, then the auction is fully efficient. Unfortunately, bidders might neither bid straightforward in the clock phase nor truthful on all packages in the second sealed-bid stage due to strategic reasons or practical limitations. We introduce metrics based on Afriat’s Efficiency Index to analyze straightforward bidding and report on empirical data from the lab and from the field in the British 4G auction in 2013 and the Canadian 700 MHz auction in 2014, where the bids were made public. The data provides evidence that bidders deviate significantly from straightforward bidding in the clock phase, which can restrict the bids they can submit in the supplementary phase. We show that such restrictions can have a significant negative impact on efficiency and revenue.

Keywords

Market design Spectrum auctions Activity rules 

References

  1. Afriat SN (1967) The construction of utility functions from expenditure data. Int Econ Rev 8(1):67–77CrossRefGoogle Scholar
  2. Afriat SN (1973) On a system of inequalities in demand analysis: an extension of the classical method. Int Econ Rev 14(2):460–472CrossRefGoogle Scholar
  3. Airiau S, Sen S (2003) Strategic bidding for multiple units in simultaneous and sequential auctions. Group Decis Negot 12(5):397–413. doi:10.1023/B:GRUP.0000003741.29640.ac CrossRefGoogle Scholar
  4. Arthur C (2013) 4G auction to be investigated by audit office after poor return. http://www.theguardian.com/technology/2013/apr/14/4g-auction-national-audit-office
  5. Ausubel L, Baranov O (2014) Market design and the evolution of the combinatorial clock auction. Am Econ Rev Pap Proc 104(5):446–451CrossRefGoogle Scholar
  6. Ausubel LM (2006) An efficient dynamic auction for heterogeneous commodities. Am Econ Rev 96(3):602–629CrossRefGoogle Scholar
  7. Ausubel LM, Milgrom PR (2002) Ascending auctions with package bidding. Front. Theor. Econ. 1(1):1–42. http://www.ausubel.com/auction-papers/ascending-proxy-auctions.pdf
  8. Ausubel LM, Cramton P, Milgrom P (2006) The clock–proxy auction: a practical combinatorial auction design. In: Cramton P, Shoham Y, Steinberg R (eds) Combinatorial auctions, chap 5. MIT Press, Cambridge, pp 115–138. The ISBN-10 is 0262514133Google Scholar
  9. Bellantuono N, Ettorre D, Kersten G, Pontrandolfo P (2013) Multi-attribute auction and negotiation for e-procurement of logistics. Group Decis Negot 1–21. doi:10.1007/s10726-013-9353-7
  10. Bichler M, Shabalin P, Wolf J (2011) Efficiency, auctioneer revenue, and bidding behavior in the combinatorial clock auction. In: Second conference on auctions. Market mechanisms and their applications (AMMA), New York, NY, USAGoogle Scholar
  11. Bichler M, Shabalin P, Wolf J (2013a) Do core-selecting combinatorial clock auctions always lead to high efficiency? An experimental analysis of spectrum auction designs. Exp Econ 16:511–545CrossRefGoogle Scholar
  12. Bichler M, Shabalin P, Ziegler G (2013b) Efficiency with linear prices? A theoretical and experimental analysis of the combinatorial clock auction. In: INFORMS information systems research, pp 394–417Google Scholar
  13. Bichler M, Goeree J, Mayer S, Shabalin P (2014) Spectrum auction design: simple auctions for complex sales. Telecommun Policy 38(7):613–622Google Scholar
  14. Cramton P (2008) A review of the L-band auction. Technical report August. http://works.bepress.com/cramton/11/
  15. Danish Business Authority (2012) Information memorandum—800 MHz auction. http://erhvervsstyrelsen.dk/file/251159/information-memorandum-800mhz-auction.pdf
  16. Day RW, Cramton P (2012) Quadratic core-selecting payment rules for combinatorial auctions. Oper Res 60(3):588–603CrossRefGoogle Scholar
  17. Goeree JK, Lien Y (2013) On the impossibility of core-selecting auctions. Theor Econ (forthcoming). http://econtheory.org/
  18. Gul F, Stacchetti E (1999) Walrasian equilibrium with gross substitutes. J Econ Theory 87(1):95–124CrossRefGoogle Scholar
  19. Janssen M, Karamychev V (2013) Gaming in combinatorial clock auctions. Technical report, Tinbergen InstituteGoogle Scholar
  20. Jewitt I, Li Z (2008) Report on the 2008 UK 10–40 GHz spectrum auction. Technical report. http://stakeholders.ofcom.org.uk/binaries/spectrum/spectrum-awards/completed-awards/jewitt.pdf
  21. Knapek S, Wambach A (2012) Strategic complexities in the combinatorial clock auction. CESifo Working Paper Series 3983, CESifo Group Munich. http://ideas.repec.org/p/ces/ceswps/_3983.html
  22. Lehmann D, Müller R, Sandholm T (2006) The winner determination problem. In: Cramton P, Shoham Y, Steinberg R (eds) Combinatorial auctions. MIT Press, chap 12. http://www.cs.cmu.edu/~sandholm/winner-determination-final.pdf
  23. Levin J, Skrzypacz A (2014) Are dynamic vickrey auctions practical? Properties of the combinatorial clock auction. Stanford University working paper SeptemberGoogle Scholar
  24. Milgrom P (2000) Putting auction theory to work: the simultaneous ascending auction. doi:10.1086/262118
  25. Milgrom P (2004) Putting auction theory to work. Cambridge University Press, CambridgeCrossRefGoogle Scholar
  26. Milgrom PR, Weber RJ (1982) A theory of auctions and competitive bidding. Econometrica 50(5):1089–1122Google Scholar
  27. Ofcom (2011) Everything Everywhere becomes the UKs largest network in terms of revenue. http://stakeholders.ofcom.org.uk/market-data-research/market-data/communications-market-reports/cmr11/telecoms-networks/5.48
  28. Ofcom (2012) The wireless telegraphy (licence award) regulations 2012. http://www.legislation.gov.uk/uksi/2012/2817/contents/made
  29. Rothkopf MH (2007) Thirteen reasons why the vickrey-clarke-groves process is not practical. Oper Res 55(2):191–197CrossRefGoogle Scholar
  30. RTR (2013) Multiband Auction 800/900/1800 MHz. Rundfunk und Telekom Regulierungs-GmbH. https://www.rtr.at/en/tk/multibandauktion
  31. Samuelson PA (1938) A note on the pure theory of consumer’s behaviour. Economica 5(17):61–71. http://www.jstor.org/stable/10.2307/2548836
  32. Sano R (2012) Non-bidding equilibrium in an ascending core-selecting auction. Games Econ Behav 74:637–650Google Scholar
  33. Scheffel T, Ziegler A, Bichler M (2012) On the impact of package selection in combinatorial auctions: an experimental study in the context of spectrum auction design. Exp Econ 15:667–692CrossRefGoogle Scholar
  34. Shapiro R, Holtz-Eakin D, Bazelon C (2013) The economic implications of restricting spectrum purchases in the incentive auctions. Georgetown University Washington working paperGoogle Scholar
  35. Smeulders B, Spieksma FCR, Cherchye L, De Rock B (2012) Goodness of fit measures for revealed preference tests: complexity results and algorithms. aghedupl V(212):1–16. http://home.agh.edu.pl/~faliszew/COMSOC-2012/proceedings/paper_11.pdf
  36. Varian HR (1990) Goodness-of-fit in optimizing models. J Econom 46:125–140. http://www.sciencedirect.com/science/article/pii/030440769090051T
  37. Varian HR (2006) Revealed preference. In: Szenberg M, Ramrattan L, Gottesman AA (eds) Samuelsonian economics and the twenty-first century, January 2005, chap 6. Oxford University Press, Oxford, pp 99–115Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2015

Authors and Affiliations

  • Christian Kroemer
    • 1
  • Martin Bichler
    • 1
  • Andor Goetzendorff
    • 1
  1. 1.Department of InformaticsTechnische Universität MünchenGarching, MunichGermany

Personalised recommendations