IDEAS home Printed from https://ideas.repec.org/a/eee/telpol/v42y2018i4p315-322.html
   My bibliography  Save this article

Mechanisms to incentivise shared-use of spectrum

Author

Listed:
  • Marsden, Richard
  • Ihle, Hans-Martin

Abstract

A key concern with the Licensed-shared access (LSA) approach currently being developed by European regulators is that leaving incumbents and secondary users to agree to bilateral arrangements may be insufficient to incentivise an optimal level of sharing.

Suggested Citation

  • Marsden, Richard & Ihle, Hans-Martin, 2018. "Mechanisms to incentivise shared-use of spectrum," Telecommunications Policy, Elsevier, vol. 42(4), pages 315-322.
    • Handle: RePEc:eee:telpol:v:42:y:2018:i:4:p:315-322
    DOI: 10.1016/j.telpol.2017.07.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0308596117302513
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.telpol.2017.07.001?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. Peter Cramton, 2013. "Spectrum Auction Design," Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 42(2), pages 161-190, March.
    2. 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.
    3. Myerson, Roger B. & Satterthwaite, Mark A., 1983. "Efficient mechanisms for bilateral trading," Journal of Economic Theory, Elsevier, vol. 29(2), pages 265-281, April.
    4. Krishna, Vijay & Rosenthal, Robert W., 1996. "Simultaneous Auctions with Synergies," Games and Economic Behavior, Elsevier, vol. 17(1), pages 1-31, November.
    5. Robert Day & Paul Milgrom, 2008. "Core-selecting package auctions," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 393-407, March.
    6. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, March.
    7. Theo Offerman, 2002. "Efficiency in Auctions with Private and Common Values: An Experimental Study," American Economic Review, American Economic Association, vol. 92(3), pages 625-643, June.
    8. Kagel, John H. & Levin, Dan, 1986. "The Winner's Curse and Public Information in Common Value Auctions," American Economic Review, American Economic Association, vol. 76(5), pages 894-920, December.
    9. Rustichini, Aldo & Satterthwaite, Mark A & Williams, Steven R, 1994. "Convergence to Efficiency in a Simple Market with Incomplete Information," Econometrica, Econometric Society, vol. 62(5), pages 1041-1063, September.
    10. Goeree, Jacob K. & Lien, Yuanchuan, 2014. "An equilibrium analysis of the simultaneous ascending auction," Journal of Economic Theory, Elsevier, vol. 153(C), pages 506-533.
    11. Robert W. Day & Peter Cramton, 2012. "Quadratic Core-Selecting Payment Rules for Combinatorial Auctions," Operations Research, INFORMS, vol. 60(3), pages 588-603, June.
    12. Thaler, Richard H, 1988. "Anomalies: The Winner's Curse," Journal of Economic Perspectives, American Economic Association, vol. 2(1), pages 191-202, Winter.
    13. Kagel, John H. & Levin, Dan, 2005. "Multi-unit demand auctions with synergies: behavior in sealed-bid versus ascending-bid uniform-price auctions," Games and Economic Behavior, Elsevier, vol. 53(2), pages 170-207, November.
    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. Jain, Rekha, 2019. "Lessons from India on the Role of Institutions in Spectrum Trading," 2nd Europe – Middle East – North African Regional ITS Conference, Aswan 2019: Leveraging Technologies For Growth 201758, International Telecommunications Society (ITS).

    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. Lawrence M. Ausubel & Oleg Baranov, 2020. "Core-selecting auctions with incomplete information," International Journal of Game Theory, Springer;Game Theory Society, vol. 49(1), pages 251-273, March.
    2. Committee, Nobel Prize, 2020. "Improvements to auction theory and inventions of new auction formats," Nobel Prize in Economics documents 2020-2, Nobel Prize Committee.
    3. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    4. Ryuji Sano, 2018. "An equilibrium analysis of a core-selecting package auction with reserve prices," Review of Economic Design, Springer;Society for Economic Design, vol. 22(3), pages 101-122, December.
    5. Lamprirni Zarpala & Dimitris Voliotis, 2022. "A core-selecting auction for portfolio's packages," Papers 2206.11516, arXiv.org, revised Feb 2024.
    6. Meng, Xin & Gunay, Hikmet, 2017. "Exposure problem in multi-unit auctions," International Journal of Industrial Organization, Elsevier, vol. 52(C), pages 165-187.
    7. 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.
    8. 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.
    9. Jeong, Seungwon (Eugene) & Lee, Joosung, 2024. "The groupwise-pivotal referral auction: Core-selecting referral strategy-proof mechanism," Games and Economic Behavior, Elsevier, vol. 143(C), pages 191-203.
    10. Roberto Burguet, 2000. "Auction theory: a guided tour," Investigaciones Economicas, Fundación SEPI, vol. 24(1), pages 3-50, January.
    11. 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.
    12. Janssen, Maarten & Kasberger, Bernhard, 2019. "On the clock of the combinatorial clock auction," Theoretical Economics, Econometric Society, vol. 14(4), November.
    13. Kemal Guler & Martin Bichler & Ioannis Petrakis, 2016. "Ascending Combinatorial Auctions with Risk Averse Bidders," Group Decision and Negotiation, Springer, vol. 25(3), pages 609-639, May.
    14. Janssen, Maarten & Kasberger, Bernhard, 2019. "On the clock of the combinatorial clock auction," Theoretical Economics, Econometric Society, vol. 14(4).
    15. Thomas Kittsteiner & Marion Ott & Richard Steinberg, 2022. "Competing Combinatorial Auctions," Information Systems Research, INFORMS, vol. 33(4), pages 1130-1137, December.
    16. Sano, Ryuji, 2012. "Non-bidding equilibrium in an ascending core-selecting auction," Games and Economic Behavior, Elsevier, vol. 74(2), pages 637-650.
    17. 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.
    18. Ewerhart, Christian & Cassola, Nuno & Valla, Natacha, 2012. "Overbidding in fixed rate tenders: The role of exposure risk," Journal of Banking & Finance, Elsevier, vol. 36(2), pages 539-549.
    19. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    20. Ravi Bapna & Chrysanthos Dellarocas & Sarah Rice, 2010. "Vertically Differentiated Simultaneous Vickrey Auctions: Theory and Experimental Evidence," Management Science, INFORMS, vol. 56(7), pages 1074-1092, July.

    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:telpol:v:42:y:2018:i:4:p:315-322. 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/wps/find/journaldescription.cws_home/30471/description#description .

    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.