IDEAS home Printed from https://ideas.repec.org/p/tin/wpaper/20130027.html
   My bibliography  Save this paper

Gaming in Combinatorial Clock Auctions

Author

Listed:
  • Maarten Janssen

    (University of Vienna)

  • Vladimir Karamychev

    (Erasmus University Rotterdam)

Abstract

Combinatorial Clock Auctions (CCAs) have recently been used around the world to allocate spectrum for mobile telecom licenses. CCAs are claimed to significantly reduce the scope for gaming or strategic bidding. This paper shows, however, that CCAs facilitate strategic bidding. Real bidders in telecom markets are not only interested in the spectrum they win themselves and the price they pay for that, but also in raising rivals’ cost. CCAs provide bidders with excellent opportunities to do so. High auction prices in recent auctions in the Netherlands and Austria are probably to a large extent due to the CCA format. Bidding under a budget constraint is also a highly complicated gaming exercise in a CCA.

Suggested Citation

  • Maarten Janssen & Vladimir Karamychev, 2013. "Gaming in Combinatorial Clock Auctions," Tinbergen Institute Discussion Papers 13-027/VII, Tinbergen Institute, revised 16 Dec 2013.
    • Handle: RePEc:tin:wpaper:20130027
    as

    Download full text from publisher

    File URL: https://papers.tinbergen.nl/13027.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Peter Cramton, 2013. "Spectrum Auction Design," Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 42(2), pages 161-190, March.
    2. Maarten C.W. Janssen & Vladimir A. Karamychev, 2010. "Do auctions select efficient firms?," Economic Journal, Royal Economic Society, vol. 120(549), pages 1319-1344, December.
    3. Jehiel, Philippe & Moldovanu, Benny & Stacchetti, Ennio, 1996. "How (Not) to Sell Nuclear Weapons," American Economic Review, American Economic Association, vol. 86(4), pages 814-829, September.
    4. Paul Klemperer, 2002. "What Really Matters in Auction Design," Journal of Economic Perspectives, American Economic Association, vol. 16(1), pages 169-189, Winter.
    5. Aytek Erdil & Paul Klemperer, 2010. "A New Payment Rule for Core-Selecting Package Auctions," Journal of the European Economic Association, MIT Press, vol. 8(2-3), pages 537-547, 04-05.
    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. Christian Kroemer & Martin Bichler & Andor Goetzendorff, 2016. "(Un)expected Bidder Behavior in Spectrum Auctions: About Inconsistent Bidding and Its Impact on Efficiency in the Combinatorial Clock Auction," Group Decision and Negotiation, Springer, vol. 25(1), pages 31-63, January.
    2. Ignacio Palacios-Huerta & David C. Parkes & Richard Steinberg, 2024. "Combinatorial Auctions in Practice," Journal of Economic Literature, American Economic Association, vol. 62(2), pages 517-553, June.
    3. Mochon, Asuncion & Saez, Yago, 2017. "A review of radio spectrum combinatorial clock auctions," Telecommunications Policy, Elsevier, vol. 41(5), pages 303-324.
    4. Jonathan Levin & Andrzej Skrzypacz, 2014. "Are Dynamic Vickrey Auctions Practical?: Properties of the Combinatorial Clock Auction," NBER Working Papers 20487, National Bureau of Economic Research, Inc.
    5. Jonathan Levin & Andrzej Skrzypacz, 2016. "Properties of the Combinatorial Clock Auction," American Economic Review, American Economic Association, vol. 106(9), pages 2528-2551, September.
    6. Janssen, Maarten & Kasberger, Bernhard, 2019. "On the clock of the combinatorial clock auction," Theoretical Economics, Econometric Society, vol. 14(4), November.
    7. Bichler, Martin & Goeree, Jacob K., 2017. "Frontiers in spectrum auction design," International Journal of Industrial Organization, Elsevier, vol. 50(C), pages 372-391.
    8. Janssen, Maarten & Karamychev, Vladimir, 2017. "Raising rivals’ cost in multi-unit auctions," International Journal of Industrial Organization, Elsevier, vol. 50(C), pages 473-490.
    9. Janssen, Maarten & Kasberger, Bernhard, 2019. "On the clock of the combinatorial clock auction," Theoretical Economics, Econometric Society, vol. 14(4).

    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. Janssen, Maarten & Karamychev, Vladimir, 2016. "Spiteful bidding and gaming in combinatorial clock auctions," Games and Economic Behavior, Elsevier, vol. 100(C), pages 186-207.
    2. Janssen, Maarten & Karamychev, Vladimir, 2017. "Raising rivals’ cost in multi-unit auctions," International Journal of Industrial Organization, Elsevier, vol. 50(C), pages 473-490.
    3. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    4. Maarten Janssen & Vladimir A. Karamychev & Emiel Maasland, 2009. "Auctions with Flexible Entry Fees," Tinbergen Institute Discussion Papers 09-109/1, Tinbergen Institute.
    5. Philippe Jehiel & Benny Moldovanu, 2005. "Allocative and Informational Externalities in Auctions and Related Mechanisms," Levine's Bibliography 784828000000000490, UCLA Department of Economics.
    6. Committee, Nobel Prize, 2020. "Improvements to auction theory and inventions of new auction formats," Nobel Prize in Economics documents 2020-2, Nobel Prize Committee.
    7. Rey, Patrick & Salant, David, 2017. "Allocating essential inputs," TSE Working Papers 17-820, Toulouse School of Economics (TSE), revised Jun 2019.
    8. Lamprirni Zarpala & Dimitris Voliotis, 2022. "A core-selecting auction for portfolio's packages," Papers 2206.11516, arXiv.org, revised Feb 2024.
    9. Janssen, Maarten C.W. & Karamychev, Vladimir A. & Maasland, Emiel, 2011. "Auctions with flexible entry fees: A note," Games and Economic Behavior, Elsevier, vol. 72(2), pages 594-601, June.
    10. Maarten C.W. Janssen & Vladimir A. Karamychev, 2010. "Do auctions select efficient firms?," Economic Journal, Royal Economic Society, vol. 120(549), pages 1319-1344, December.
    11. Cherbonnier, Frédéric & Salant, David & Van Der Straeten, Karine, 2021. "Getting auctions for transportation capacity to roll," TSE Working Papers 21-1254, Toulouse School of Economics (TSE).
    12. Peter Cramton & Andrzej Skrzypacz & Robert Wilson, 2007. "Revenues in the 700 MHz Spectrum Auction," Papers of Peter Cramton 07rev700, University of Maryland, Department of Economics - Peter Cramton, revised 2007.
    13. Janssen, Maarten C.W. & Karamychev, Vladimir A., 2009. "Auctions, aftermarket competition, and risk attitudes," International Journal of Industrial Organization, Elsevier, vol. 27(2), pages 274-285, March.
    14. Kasberger, Bernhard, 2023. "When can auctions maximize post-auction welfare?," International Journal of Industrial Organization, Elsevier, vol. 89(C).
    15. Benedikt Bünz & Benjamin Lubin & Sven Seuken, 2022. "Designing Core-Selecting Payment Rules: A Computational Search Approach," Information Systems Research, INFORMS, vol. 33(4), pages 1157-1173, December.
    16. Avenali, Alessandro & D'Alfonso, Tiziana & Leporelli, Claudio & Matteucci, Giorgio & Nastasi, Alberto & Reverberi, Pierfrancesco, 2015. "An incentive pricing mechanism for efficient airport slot allocation in Europe," Journal of Air Transport Management, Elsevier, vol. 42(C), pages 27-36.
    17. Bartling, Björn & Netzer, Nick, 2016. "An externality-robust auction: Theory and experimental evidence," Games and Economic Behavior, Elsevier, vol. 97(C), pages 186-204.
    18. Onur A. Koska & Ilke Onur & Frank Stähler, 2018. "The scope of auctions in the presence of downstream interactions and information externalities," Journal of Economics, Springer, vol. 125(2), pages 107-136, October.
    19. 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.
    20. 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).

    More about this item

    Keywords

    Combinatorial auctions; Telecom markets; Raising rivals' cost;
    All these keywords.

    JEL classification:

    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions
    • L96 - Industrial Organization - - Industry Studies: Transportation and Utilities - - - Telecommunications

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:tin:wpaper:20130027. 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: Tinbergen Office +31 (0)10-4088900 (email available below). General contact details of provider: https://edirc.repec.org/data/tinbenl.html .

    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.