IDEAS home Printed from https://ideas.repec.org/a/eee/iepoli/v27y2014icp13-23.html
   My bibliography  Save this article

Spectrum license auctions with exit (and call) options: Alternative remedies for the exposure problem

Author

Listed:
  • Hu, Luke
  • Wolfstetter, Elmar G.

Abstract

Inspired by some spectrum auctions we consider a stylized license auction with incumbents and a potential entrant. Whereas the entrant values only the bundle of several spectrum blocks (synergy), incumbents’ marginal valuations are non-increasing. The seller proactively encourages entry and subjects incumbents to a spectrum cap. In this framework, a simultaneous multi-round auction (SMRA) gives rise to an exposure problem that distorts efficiency and yields low revenue. We consider three remedies and rank their performance: a combinatorial Vickrey auction, a SMRA with exit option that allows the entrant to annul his bid, and a SMRA with call option that lifts the spectrum cap if entry failed to occur and then allows the successful incumbent to acquire stranded spectrum at a fixed price.

Suggested Citation

  • Hu, Luke & Wolfstetter, Elmar G., 2014. "Spectrum license auctions with exit (and call) options: Alternative remedies for the exposure problem," Information Economics and Policy, Elsevier, vol. 27(C), pages 13-23.
    • Handle: RePEc:eee:iepoli:v:27:y:2014:i:c:p:13-23
    DOI: 10.1016/j.infoecopol.2014.04.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167624514000134
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.infoecopol.2014.04.002?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Rosenthal, Robert W. & Wang, Ruqu, 1996. "Simultaneous Auctions with Synergies and Common Values," Games and Economic Behavior, Elsevier, vol. 17(1), pages 32-55, November.
    2. Jeremy Bulow & Jonathan Levin & Paul Milgrom, 2009. "Winning Play in Spectrum Auctions," NBER Working Papers 14765, National Bureau of Economic Research, Inc.
    3. Peter Cramton & Evan Kwerel & Gregory Rosston & Andrzej Skrzypacz, 2011. "Using Spectrum Auctions to Enhance Competition in Wireless Services," Journal of Law and Economics, University of Chicago Press, vol. 54(S4), pages 167-188.
    4. Frank Riedel & Elmar Wolfstetter, 2006. "Immediate demand reduction in simultaneous ascending-bid auctions: a uniqueness result," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 29(3), pages 721-726, November.
    5. Ausubel Lawrence M & Milgrom Paul R, 2002. "Ascending Auctions with Package Bidding," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 1(1), pages 1-44, August.
    6. Klemperer, Paul, 2002. "How (not) to run auctions: The European 3G telecom auctions," European Economic Review, Elsevier, vol. 46(4-5), pages 829-845, May.
    7. Krishna, Vijay & Rosenthal, Robert W., 1996. "Simultaneous Auctions with Synergies," Games and Economic Behavior, Elsevier, vol. 17(1), pages 1-31, November.
    8. Grimm, Veronika & Riedel, Frank & Wolfstetter, Elmar, 2003. "Low price equilibrium in multi-unit auctions: the GSM spectrum auction in Germany," International Journal of Industrial Organization, Elsevier, vol. 21(10), pages 1557-1569, December.
    9. Milgrom,Paul, 2004. "Putting Auction Theory to Work," Cambridge Books, Cambridge University Press, number 9780521536721, September.
    10. van Damme, Eric, 2002. "The European UMTS-auctions," European Economic Review, Elsevier, vol. 46(4-5), pages 846-858, May.
    11. Michael H. Rothkopf, 2007. "Thirteen Reasons Why the Vickrey-Clarke-Groves Process Is Not Practical," Operations Research, INFORMS, vol. 55(2), pages 191-197, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wolfstetter, Elmar G., 2022. "Universal high-speed broadband provision: A simple auction approach," Information Economics and Policy, Elsevier, vol. 60(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hu, Luke & Wolfstetter, Elmar G., 2012. "License auctions with exit (and entry) options: Alternative remedies for the exposure problem," Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems 394, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich.
    2. Chernomaz, Kirill & Levin, Dan, 2012. "Efficiency and synergy in a multi-unit auction with and without package bidding: An experimental study," Games and Economic Behavior, Elsevier, vol. 76(2), pages 611-635.
    3. Peter Cramton, 2013. "Spectrum Auction Design," Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 42(2), pages 161-190, March.
    4. Kazumori, Eiichiro & Belch, Yaakov, 2019. "t-Tree: The Tokyo toolbox for large-scale combinatorial auction experiments," Journal of Behavioral and Experimental Finance, Elsevier, vol. 24(C).
    5. Zheng, Charles Z., 2012. "Jump bidding and overconcentration in decentralized simultaneous ascending auctions," Games and Economic Behavior, Elsevier, vol. 76(2), pages 648-664.
    6. Lamprirni Zarpala & Dimitris Voliotis, 2022. "A core-selecting auction for portfolio's packages," Papers 2206.11516, arXiv.org, revised Feb 2024.
    7. Emiel Maasland & Sander Onderstal, 2006. "Going, Going, Gone! A Swift Tour of Auction Theory and its Applications," De Economist, Springer, vol. 154(2), pages 197-249, June.
    8. Pallab Sanyal, 2016. "Characteristics and Economic Consequences of Jump Bids in Combinatorial Auctions," Information Systems Research, INFORMS, vol. 27(2), pages 347-364, June.
    9. Daglish, Toby & Sağlam, Yiğit & Ho, Phuong, 2017. "Auctioning the Digital Dividend: A model for spectrum auctions," International Journal of Industrial Organization, Elsevier, vol. 53(C), pages 63-98.
    10. Nicholas C. Bedard & Jacob K. Goeree & Philippos Louis & Jingjing Zhang, 2024. "Sealed-bid versus ascending spectrum auctions," Experimental Economics, Springer;Economic Science Association, vol. 27(2), pages 299-324, April.
    11. Bichler, Martin & Paulsen, Per, 2018. "A principal-agent model of bidding firms in multi-unit auctions," Games and Economic Behavior, Elsevier, vol. 111(C), pages 20-40.
    12. Gentry, Matthew & Komarova, Tatiana & Schiraldi, Pasquale & Shin, Wiroy, 2019. "On monotone strategy equilibria in simultaneous auctions for complementary goods," Journal of Mathematical Economics, Elsevier, vol. 85(C), pages 109-128.
    13. Ning Sun & Zaifu Yang, 2014. "An Efficient and Incentive Compatible Dynamic Auction for Multiple Complements," Journal of Political Economy, University of Chicago Press, vol. 122(2), pages 422-466.
    14. Brusco, Sandro & Lopomo, Giuseppe & Marx, Leslie M., 2009. "The [`]Google effect' in the FCC's 700Â MHz auction," Information Economics and Policy, Elsevier, vol. 21(2), pages 101-114, June.
    15. Englmaier, Florian & Guillén, Pablo & Llorente, Loreto & Onderstal, Sander & Sausgruber, Rupert, 2009. "The chopstick auction: A study of the exposure problem in multi-unit auctions," International Journal of Industrial Organization, Elsevier, vol. 27(2), pages 286-291, March.
    16. Jacob Goeree & Theo Offerman & Randolph Sloof, 2013. "Demand reduction and preemptive bidding in multi-unit license auctions," Experimental Economics, Springer;Economic Science Association, vol. 16(1), pages 52-87, March.
    17. Frank Riedel & Elmar G. Wolfstetter, 2004. "Immediate Demand Reduction in Simultaneous Ascending Bid Auctions (new title: Immediate demand reduction in simultaneous ascending-bid auctions: a uniqueness result)," CESifo Working Paper Series 1315, CESifo.
    18. Lamy, Laurent, 2012. "On minimal ascending auctions with payment discounts," Games and Economic Behavior, Elsevier, vol. 75(2), pages 990-999.
    19. Thomas Kittsteiner & Marion Ott & Richard Steinberg, 2022. "Competing Combinatorial Auctions," Information Systems Research, INFORMS, vol. 33(4), pages 1130-1137, December.
    20. Kuroda, Toshifumi & Baquero Forero, Maria del Pilar, 2017. "The effects of spectrum allocation mechanisms on market outcomes: Auctions vs beauty contests," Telecommunications Policy, Elsevier, vol. 41(5), pages 341-354.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:iepoli:v:27:y:2014:i:c:p:13-23. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505549 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.