IDEAS home Printed from https://ideas.repec.org/a/eee/indorg/v60y2018icp206-227.html
   My bibliography  Save this article

Efficient and optimal mechanisms with radio spectrum sharing

Author

Listed:
  • Zhang, Chenglin
  • Ye, Lixin
  • Johnson, Joel
  • Baker, Christopher
  • Wang, Huaiyi

Abstract

Optimal mechanism design with spectrum sharing differs from the traditional setting mainly in that some technological constraints (e.g., non-interference constraints) need to be taken into account explicitly. In this paper we characterize surplus-maximizing (efficient) and revenue-maximizing (optimal) mechanisms in a spectrum sharing context where a principal allocates transmitted power among a group of potentially interested users (transmitter-receiver pairs). Under regularity conditions about value distributions and non-interference constraints, we show that efficiency (optimality) typically involves spectrum sharing by multiple users, and the exact allocation of transmitted power is determined such that the ratio of marginal value (virtual value) over marginal cost (in terms of the cost to the interference generated) is equal among all shared users. We show that efficient and optimal mechanisms in our setting are actually dominant-strategy incentive compatible, and that they can also be implemented by well-designed all-pay or discriminatory-price auctions.

Suggested Citation

  • Zhang, Chenglin & Ye, Lixin & Johnson, Joel & Baker, Christopher & Wang, Huaiyi, 2018. "Efficient and optimal mechanisms with radio spectrum sharing," International Journal of Industrial Organization, Elsevier, vol. 60(C), pages 206-227.
    • Handle: RePEc:eee:indorg:v:60:y:2018:i:c:p:206-227
    DOI: 10.1016/j.ijindorg.2018.08.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167718718300171
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijindorg.2018.08.004?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. Ye, Lixin, 2007. "Indicative bidding and a theory of two-stage auctions," Games and Economic Behavior, Elsevier, vol. 58(1), pages 181-207, January.
    2. Milgrom,Paul, 2004. "Putting Auction Theory to Work," Cambridge Books, Cambridge University Press, number 9780521536721, October.
    3. Peter Cramton, 2013. "Spectrum Auction Design," Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 42(2), pages 161-190, March.
    4. 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.
    5. Jaime F. Zender & James J.D. Wang, 2002. "Auctioning divisible goods," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 19(4), pages 673-705.
    6. Peter Cramton & Yoav Shoham & Richard Steinberg (ed.), 2006. "Combinatorial Auctions," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262033429, April.
    7. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    8. Richard L. Fullerton & R. Preston McAfee, 1999. "Auctioning Entry into Tournaments," Journal of Political Economy, University of Chicago Press, vol. 107(3), pages 573-605, June.
    9. Myerson, Roger B, 1986. "Multistage Games with Communication," Econometrica, Econometric Society, vol. 54(2), pages 323-358, March.
    10. Back, Kerry & Zender, Jaime F, 1993. "Auctions of Divisible Goods: On the Rationale for the Treasury Experiment," The Review of Financial Studies, Society for Financial Studies, vol. 6(4), pages 733-764.
    Full references (including those not matched with items on IDEAS)

    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. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    2. Alexander Teytelboym & Shengwu Li & Scott Duke Kominers & Mohammad Akbarpour & Piotr Dworczak, 2021. "Discovering Auctions: Contributions of Paul Milgrom and Robert Wilson," Scandinavian Journal of Economics, Wiley Blackwell, vol. 123(3), pages 709-750, July.
    3. Committee, Nobel Prize, 2020. "Improvements to auction theory and inventions of new auction formats," Nobel Prize in Economics documents 2020-2, Nobel Prize Committee.
    4. Alcalde, José & Dahm, Matthias, 2019. "Dual sourcing with price discovery," Games and Economic Behavior, Elsevier, vol. 115(C), pages 225-246.
    5. Vasiliki Skreta, 2011. "On the informed seller problem: optimal information disclosure," Review of Economic Design, Springer;Society for Economic Design, vol. 15(1), pages 1-36, March.
    6. Lu, Jingfeng & Ye, Lixin, 2013. "Efficient and optimal mechanisms with private information acquisition costs," Journal of Economic Theory, Elsevier, vol. 148(1), pages 393-408.
    7. Burkett, Justin & Woodward, Kyle, 2020. "Uniform price auctions with a last accepted bid pricing rule," Journal of Economic Theory, Elsevier, vol. 185(C).
    8. Peyman Khezr & Anne Cumpston, 2022. "A review of multiunit auctions with homogeneous goods," Journal of Economic Surveys, Wiley Blackwell, vol. 36(4), pages 1225-1247, September.
    9. 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.
    10. Robert W. Day & Peter Cramton, 2012. "Quadratic Core-Selecting Payment Rules for Combinatorial Auctions," Operations Research, INFORMS, vol. 60(3), pages 588-603, June.
    11. Daley, Brendan & Schwarz, Michael & Sonin, Konstantin, 2012. "Efficient investment in a dynamic auction environment," Games and Economic Behavior, Elsevier, vol. 75(1), pages 104-119.
    12. Philippe Jehiel & Laurent Lamy, 2020. "On the Benefits of Set-Asides," Journal of the European Economic Association, European Economic Association, vol. 18(4), pages 1655-1696.
    13. 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.
    14. Kazuo Murota, 2016. "Discrete convex analysis: A tool for economics and game theory," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 151-273, December.
    15. Paul Milgrom, 2009. "Assignment Messages and Exchanges," American Economic Journal: Microeconomics, American Economic Association, vol. 1(2), pages 95-113, August.
    16. Satoru Fujishige & Zaifu Yang, 2020. "A Universal Dynamic Auction for Unimodular Demand Types: An Efficient Auction Design for Various Kinds of Indivisible Commodities," Discussion Papers 20/08, Department of Economics, University of York.
    17. Estrella Alonso & Joaquín Sánchez-Soriano & Juan Tejada, 2020. "Mixed Mechanisms for Auctioning Ranked Items," Mathematics, MDPI, vol. 8(12), pages 1-26, December.
    18. Chakravarty, Surajeet & Kaplan, Todd R., 2013. "Optimal allocation without transfer payments," Games and Economic Behavior, Elsevier, vol. 77(1), pages 1-20.
    19. Andor Goetzendorff & Martin Bichler & Pasha Shabalin & Robert W. Day, 2015. "Compact Bid Languages and Core Pricing in Large Multi-item Auctions," Management Science, INFORMS, vol. 61(7), pages 1684-1703, July.
    20. Dütting, Paul & Fischer, Felix & Parkes, David C., 2019. "Expressiveness and robustness of first-price position auctions," LSE Research Online Documents on Economics 85877, London School of Economics and Political Science, LSE Library.

    More about this item

    Keywords

    Spectrum sharing; Spectrum sharing mechanisms; Efficiency; Optimality;
    All these keywords.

    JEL classification:

    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions
    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
    • L52 - Industrial Organization - - Regulation and Industrial Policy - - - Industrial Policy; Sectoral Planning Methods

    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:eee:indorg:v:60:y:2018:i:c:p:206-227. 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/505551 .

    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.