IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2512.21793.html

Sharing with Frictions: Limited Transfers and Costly Inspections

Author

Listed:
  • Federico Bobbio
  • Randall A. Berry
  • Michael L. Honig
  • Thanh Nguyen
  • Vijay G. Subramanian
  • Rakesh V. Vohra

Abstract

The radio spectrum suitable for commercial wireless services is limited. A portion of the radio spectrum has been reserved for institutions using it for non-commercial purposes such as federal agencies, defense, public safety bodies and scientific institutions. In order to operate efficiently, these incumbents need clean spectrum access. However, commercial users also want access, and granting them access may materially interfere with the existing activity of the incumbents. Conventional market based mechanisms for allocating scarce resources in this context are problematic. Allowing direct monetary transfers to and from public or scientific institutions risks distorting their non-commercial mission. Moreover, often only the incumbent knows the exact value of the interference it experiences, and, likewise, only commercial users can predict accurately the expected monetary outcome from sharing the resource. Thus, our problem is to determine the efficient allocation of resources in the presence of private information without the use of direct monetary transfers. The problem is not unique to spectrum. Other resources that governments hold in trust share the same feature. We propose a novel mechanism design formulation of the problem, characterize the optimal mechanism and describe some of its qualitative properties.

Suggested Citation

  • Federico Bobbio & Randall A. Berry & Michael L. Honig & Thanh Nguyen & Vijay G. Subramanian & Rakesh V. Vohra, 2025. "Sharing with Frictions: Limited Transfers and Costly Inspections," Papers 2512.21793, arXiv.org.
  • Handle: RePEc:arx:papers:2512.21793
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2512.21793
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Weitzman, Martin L, 1979. "Optimal Search for the Best Alternative," Econometrica, Econometric Society, vol. 47(3), pages 641-654, May.
    2. Li, Yunan, 2020. "Mechanism design with costly verification and limited punishments," Journal of Economic Theory, Elsevier, vol. 186(C).
    3. Li, Yunan, 2021. "Mechanism design with financially constrained agents and costly verification," Theoretical Economics, Econometric Society, vol. 16(3), July.
    4. Elchanan Ben-Porath & Eddie Dekel & Barton L. Lipman, 2014. "Optimal Allocation with Costly Verification," American Economic Review, American Economic Association, vol. 104(12), pages 3779-3813, December.
    5. Jerry R. Green & Jean-Jacques Laffont, 1986. "Partially Verifiable Information and Mechanism Design," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 53(3), pages 447-456.
    6. Saeed Alaei & Alexandre Belloni & Ali Makhdoumi & Azarakhsh Malekian, 2024. "Optimal Auction Design with Deferred Inspection and Reward," Operations Research, INFORMS, vol. 72(6), pages 2413-2429, November.
    7. Tymofiy Mylovanov & Andriy Zapechelnyuk, 2017. "Optimal Allocation with Ex Post Verification and Limited Penalties," American Economic Review, American Economic Association, vol. 107(9), pages 2666-2694, September.
    8. Doval, Laura, 2018. "Whether or not to open Pandora's box," Journal of Economic Theory, Elsevier, vol. 175(C), pages 127-158.
    9. Townsend, Robert M., 1979. "Optimal contracts and competitive markets with costly state verification," Journal of Economic Theory, Elsevier, vol. 21(2), pages 265-293, October.
    10. Piotr Dworczak & Ellen V. Muir, 2023. "A mechanism-design approach to property rights," GRAPE Working Papers 86, GRAPE Group for Research in Applied Economics.
    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. Geoffrey A. Chua & Gaoji Hu & Fang Liu, 2023. "Optimal multi-unit allocation with costly verification," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 61(3), pages 455-488, October.
    2. Alireza Fallah & Michael I. Jordan, 2023. "Contract Design With Safety Inspections," Papers 2311.02537, arXiv.org.
    3. Halil I. Bayrak & Martin Bichler, 2025. "Distributionally Robust Contract Design with Deferred Inspection," Papers 2506.04767, arXiv.org, revised Jan 2026.
    4. Li, Yunan & Zhang, Xingtan, 2024. "Collective decision through an informed mediator," Journal of Economic Theory, Elsevier, vol. 218(C).
    5. Erlanson, Albin & Kleiner, Andreas, 2020. "Costly verification in collective decisions," Theoretical Economics, Econometric Society, vol. 15(3), July.
    6. Yunan Li, 2017. "Mechanism Design with Costly Verification and Limited Punishments, Third Version," PIER Working Paper Archive 16-009, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 28 Sep 2017.
    7. Ian Ball & Deniz Kattwinkel, 2019. "Probabilistic Verification in Mechanism Design," Papers 1908.05556, arXiv.org, revised Jan 2025.
    8. Albin Erlanson & Andreas Kleiner, 2024. "Optimal allocations with capacity constrained verification," Papers 2409.02031, arXiv.org.
    9. Elchanan Ben-Porath & Eddie Dekel & Barton L. Lipman, 2014. "Optimal Allocation with Costly Verification," American Economic Review, American Economic Association, vol. 104(12), pages 3779-3813, December.
    10. Goel, Sumit & Hann-Caruthers, Wade, 2024. "Project selection with partially verifiable information," Mathematical Social Sciences, Elsevier, vol. 132(C), pages 105-113.
    11. Li, Yunan, 2020. "Mechanism design with costly verification and limited punishments," Journal of Economic Theory, Elsevier, vol. 186(C).
    12. Ivan Balbuzanov, 2019. "Lies and consequences," International Journal of Game Theory, Springer;Game Theory Society, vol. 48(4), pages 1203-1240, December.
    13. Christoph Siemroth, 2024. "Ending Wasteful Year‐End Spending: On Optimal Budget Rules In Organizations," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 65(3), pages 1163-1188, August.
    14. Chen, Jiakai, 2021. "LIBOR's poker," Journal of Financial Markets, Elsevier, vol. 55(C).
    15. Yingkai Li & Xiaoyun Qiu, 2023. "Mechanism Design under Costly Signaling: the Value of Non-Coordination," Papers 2302.09168, arXiv.org, revised Feb 2026.
    16. Andrei Barbos, 2022. "Optimal contracts with random monitoring," International Journal of Game Theory, Springer;Game Theory Society, vol. 51(1), pages 119-154, March.
    17. Yingkai Li & Xiaoyun Qiu, 2026. "Allocating Resources under Strategic Misrepresentation," Papers 2603.04173, arXiv.org.
    18. Halil .Ibrahim Bayrak & c{C}au{g}{i}l Koc{c}yiu{g}it & Daniel Kuhn & Mustafa c{C}elebi P{i}nar, 2022. "Distributionally Robust Optimal Allocation with Costly Verification," Papers 2211.15122, arXiv.org, revised Jun 2024.
    19. Deniz Kattwinkel & Justus Preusser, 2025. "The Division of Surplus and the Burden of Proof," Papers 2501.14686, arXiv.org, revised Oct 2025.
    20. Ian Ball & Deniz Kattwinkel, 2019. "Probabilistic Verification in Mechanism Design," CRC TR 224 Discussion Paper Series crctr224_2019_124, University of Bonn and University of Mannheim, Germany.

    More about this item

    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:arx:papers:2512.21793. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.