IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2409.02031.html
   My bibliography  Save this paper

Optimal allocations with capacity constrained verification

Author

Listed:
  • Albin Erlanson
  • Andreas Kleiner

Abstract

A principal has $m$ identical objects to allocate among a group of $n$ agents. Objects are desirable and the principal's value of assigning an object to an agent is the agent's private information. The principal can verify up to $k$ agents, where $k

Suggested Citation

  • Albin Erlanson & Andreas Kleiner, 2024. "Optimal allocations with capacity constrained verification," Papers 2409.02031, arXiv.org.
    • Handle: RePEc:arx:papers:2409.02031
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Erlanson, Albin & Kleiner, Andreas, 2020. "Costly verification in collective decisions," Theoretical Economics, Econometric Society, vol. 15(3), July.
    2. 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.
    3. Kim C. Border & Joel Sobel, 1987. "Samurai Accountant: A Theory of Auditing and Plunder," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 54(4), pages 525-540.
    4. 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.
    5. Elchanan Ben‐Porath & Eddie Dekel & Barton L. Lipman, 2019. "Mechanisms With Evidence: Commitment and Robustness," Econometrica, Econometric Society, vol. 87(2), pages 529-566, March.
    6. Border, Kim C, 1991. "Implementation of Reduced Form Auctions: A Geometric Approach," Econometrica, Econometric Society, vol. 59(4), pages 1175-1187, July.
    7. 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.
    8. Bull, Jesse & Watson, Joel, 2007. "Hard evidence and mechanism design," Games and Economic Behavior, Elsevier, vol. 58(1), pages 75-93, January.
    9. Ben-Porath, Elchanan & Lipman, Barton L., 2012. "Implementation with partial provability," Journal of Economic Theory, Elsevier, vol. 147(5), pages 1689-1724.
    10. Yeon‐Koo Che & Jinwoo Kim & Konrad Mierendorff, 2013. "Generalized Reduced‐Form Auctions: A Network‐Flow Approach," Econometrica, Econometric Society, vol. 81(6), pages 2487-2520, November.
    11. Jacob Glazer & Ariel Rubinstein, 2004. "On Optimal Rules of Persuasion," Econometrica, Econometric Society, vol. 72(6), pages 1715-1736, November.
    12. 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.
    13. Deniz Kattwinkel & Jan Knoepfle, 2023. "Costless Information and Costly Verification: A Case for Transparency," Journal of Political Economy, University of Chicago Press, vol. 131(2), pages 504-548.
    14. Maskin, Eric S & Riley, John G, 1984. "Optimal Auctions with Risk Averse Buyers," Econometrica, Econometric Society, vol. 52(6), pages 1473-1518, November.
    15. Douglas Gale & Martin Hellwig, 1985. "Incentive-Compatible Debt Contracts: The One-Period Problem," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 52(4), pages 647-663.
    16. Deneckere, Raymond & Severinov, Sergei, 2008. "Mechanism design with partial state verifiability," Games and Economic Behavior, Elsevier, vol. 64(2), pages 487-513, November.
    17. Marina Halac & Pierre Yared, 2020. "Commitment versus Flexibility with Costly Verification," Journal of Political Economy, University of Chicago Press, vol. 128(12), pages 4523-4573.
    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. Erlanson, Albin & Kleiner, Andreas, 2020. "Costly verification in collective decisions," Theoretical Economics, Econometric Society, vol. 15(3), July.
    2. 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.
    3. 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.
    4. Marina Halac & Pierre Yared, 2016. "Commitment vs. Flexibility with Costly Verification," NBER Working Papers 22936, National Bureau of Economic Research, Inc.
    5. Frédéric Koessler & Eduardo Perez-Richet, 2019. "Evidence reading mechanisms," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 53(3), pages 375-397, October.
    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 Jul 2024.
    8. Li, Yunan, 2020. "Mechanism design with costly verification and limited punishments," Journal of Economic Theory, Elsevier, vol. 186(C).
    9. Alireza Fallah & Michael I. Jordan, 2023. "Contract Design With Safety Inspections," Papers 2311.02537, arXiv.org.
    10. Soumen Banerjee & Yi-Chun Chen, 2022. "Implementation with Uncertain Evidence," Papers 2209.10741, arXiv.org.
    11. Sebastian Schweighofer-Kodritsch & Roland Strausz, 2023. "Principled Mechanism Design with Evidence," Berlin School of Economics Discussion Papers 0030, Berlin School of Economics.
    12. Elchanan Ben‐Porath & Eddie Dekel & Barton L. Lipman, 2019. "Mechanisms With Evidence: Commitment and Robustness," Econometrica, Econometric Society, vol. 87(2), pages 529-566, March.
    13. Ivan Balbuzanov, 2019. "Lies and consequences," International Journal of Game Theory, Springer;Game Theory Society, vol. 48(4), pages 1203-1240, December.
    14. Caffera, Marcelo & Dubra, Juan & Figueroa, Nicolás, 2018. "Mechanism design when players’ preferences and information coincide," Mathematical Social Sciences, Elsevier, vol. 91(C), pages 56-61.
    15. Konrad Stahl & Roland Strausz, 2017. "Certification and Market Transparency," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 84(4), pages 1842-1868.
    16. Sumit Goel & Wade Hann-Caruthers, 2020. "Project selection with partially verifiable information," Papers 2007.00907, arXiv.org, revised Feb 2022.
    17. Sher, Itai & Vohra, Rakesh, 2015. "Price discrimination through communication," Theoretical Economics, Econometric Society, vol. 10(2), May.
    18. Ben-Porath, Elchanan & Lipman, Barton L., 2012. "Implementation with partial provability," Journal of Economic Theory, Elsevier, vol. 147(5), pages 1689-1724.
    19. 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.
    20. Yingkai Li & Xiaoyun Qiu, 2023. "Screening Signal-Manipulating Agents via Contests," Papers 2302.09168, arXiv.org, revised Feb 2024.

    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:2409.02031. 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.