Skip to content

Bachelor's thesis (@ Technical University Munich): simulation of the German spectrum auction from 2015 "Mobiles Breitband - Projekt 2016"

License

Notifications You must be signed in to change notification settings

timbrgr/auction-simulation-SMRA-HPB-BA-thesis

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Bachelor's thesis: auction simulation SMRA vs HPB

Bachelor's thesis (@Technical University Munich): simulation of the German spectrum auction from 2015 "Mobiles Breitband - Projekt 2016"

Abstract

With specific implementations varying world wide, characteristically spectrum auctions comprise of many licenses being auctioned simultaneously. Allowing bidders to submit bids only on single items such as in the well established Simultaneous Multi-Round Action (SMRA), acquiring certain combinations of complementing objects can arise in strategical problems for bidders. Combinatorial auctions try to mitigate this effect by allowing bids on bundles of items, but computational challenges emerge due to possible allocations being in combinatorial magnitude with growing number of items being offered. To reduce computational effort, Hierarchical Package Bidding (HPB) was introduced which arranges items in a hierarchical tree structure. The effort of this thesis is to explore indications of the eligibility of HPB in the context of spectrums auctions by running simulations of the SMRA and HPB auction formats based on the German spectrum auction of 2015. The results indicate, that HPB might be helpful in enabling bidders to find more efficient overall allocations when choosing an appropriate bidding hierarchy. This improvement came with the reduction of overall revenue as bidder signalling improved. SMRA was superior when a less competitive HPB hierarchy was used, indicating that choosing a suitable hierarchy is key to the success of the auction.

References

[BDD00] C. H. Brooks, E. H. Durfee, and R. Das. “Price wars and niche discovery in an information economy.” In: Proceedings of the 2nd ACM conference on Electronic commerce - EC ’00 (2000), pp. 95–106. doi: 10.1145/352871.352882.

[BGJ16] M. Bichler, V. Gretschko, and M. Janssen. “Bargaining in Spectrum Auctions: A Review of the German Auction in 2015.” 2016.

[Bic16] M. Bichler. The Simultaneous Multi-Round Auction Format. Munich: Technical University Munich, 2016, pp. 99–110.

[Bun15] Bundesnetzagentur. Entscheidung der Präsidentenkammer der Bundesnetzagentur für Elektrizität, Gas, Telekommunikation, Post und Eisenbahnen vom 28. Januar 2015 zur Anordnung und Wahl des Verfahrens sowie über die Festlegungen und Regeln im Einzelnen (Vergaberegeln) und über. 2015.

[Cra02] P. Cramton. “Spectrum Auctions.” In: Handbook of Telecommunications Economics (2002), pp. 605–639. doi: 10.1007/978-1-4419-6111-2.

[CSS06] P. Cramton, Y. Shoham, and R. Steinberg. “Combinatorial auctions.” In: MIT Press (2006), p. 1179. doi: 10.7551/mitpress/9780262033428.001.0001.

[Fie15] FierceWireless. France raises EUR 2.8B from 700 MHz spectrum auction. 2015.

[GH10] J. K. Goeree and C. A. Holt. “Hierarchical package bidding: A paper & pencil combinatorial auction.” In: Games and Economic Behavior 70.1 (2010), pp. 146–169. issn: 08998256. doi: 10.1016/j.geb.2008.02.013.

[IC14] S. Innovation and E. D. Canada. Licensing Framework for Broadband Radio Service (BRS) - 2500 MHz Band. 2014.

[Lev04] J. Levin. “Auction Theory.” 2004.

[Lev09] J. Levin. “Simultaneous Ascending Auctions.” 2009.

[Mil00] P. R. Milgrom. Putting Auction Theory to Work. Vol. 108. 2. 2000, pp. 245–272. isbn: 0521536723. doi: 10.1086/262118.

[MM05] F. M. Menezes and P. K. Monteiro. “An Introduction to Auction Theory.” In: An Introduction to Auction Theory (2005), pp. 1–224. doi: 10.1093/019927598X. 001.0001.

[Nis+07] N. Nisan, T. Roughgarden, É. Taros, and V. V. Vazirani. Algorithmic Game Theory. Cambridge, New York, Melbourne, Madrid, Cape Town, Singapore, Sao Paulo, Delhi: Cambridge University Press, 2007.

[RPH98] M. H. Rothkopf, A. Pekeˇc, and R. M. Harstad. “Computitional Manageable Combinatitional Auction.” In: Management science 44 (1998), pp. 1131–1147.

[SL10] Y. Shoham and K. Leyton-Brown. Multiagent Systems: Algorithmic, Game- Theoretic, and Logical Foundations. 2010. isbn: 978-0-262-01889-0. doi: 10 . 1073/pnas.97.18.9840.

[Vic61] W. Vickrey. “Counterspeculation, Auctions, and Competitive Sealed Tenders.” In: Journal of Finance 16.1 (1961), pp. 8–37.

[Wel+08] M. P. Wellman, A. Osepayshvili, J. K. MacKie-Mason, and D. Reeves. “Bidding Strategies for Simultaneous Ascending Auctions.” In: The B.E. Journal of Theoretical Economics 8.1 (2008), pp. 1–35. issn: 1534598X. doi: 10.2202/1935- 1704.1461.

About

Bachelor's thesis (@ Technical University Munich): simulation of the German spectrum auction from 2015 "Mobiles Breitband - Projekt 2016"

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published