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

Optimal Sequential Assignment with Capacity Constrained Verification

Author

Listed:
  • Vilok Taori

Abstract

A principal seeks to allocate $k$ identical objects among n sequentially arriving, impatient agents. Each agent privately observes her valuation, and the principal's payoff from allocating an object depends on the recipient's valuation. The principal can perfectly verify the valuation of at most $m$ agents, where $m

Suggested Citation

  • Vilok Taori, 2026. "Optimal Sequential Assignment with Capacity Constrained Verification," Papers 2608.10478, arXiv.org.
    • Handle: RePEc:arx:papers:2608.10478
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Popov, Latchezar, 2016. "Stochastic costly state verification and dynamic contracts," Journal of Economic Dynamics and Control, Elsevier, vol. 64(C), pages 1-22.
    2. 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.
    3. Erlanson, Albin & Kleiner, Andreas, 2020. "Costly verification in collective decisions," Theoretical Economics, Econometric Society, vol. 15(3), July.
    4. Cyrus Derman & Gerald J. Lieberman & Sheldon M. Ross, 1972. "A Sequential Stochastic Assignment Problem," Management Science, INFORMS, vol. 18(7), pages 349-355, March.
    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. Gershkov, Alex & Moldovanu, Benny, 2010. "Efficient sequential assignment with incomplete information," Games and Economic Behavior, Elsevier, vol. 68(1), pages 144-154, January.
    7. Albin Erlanson & Andreas Kleiner, 2024. "Optimal allocations with capacity constrained verification," Papers 2409.02031, arXiv.org.
    8. 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. Albin Erlanson & Andreas Kleiner, 2024. "Optimal allocations with capacity constrained verification," Papers 2409.02031, arXiv.org.
    2. Deniz Kattwinkel & Justus Preusser, 2025. "The Division of Surplus and the Burden of Proof," Papers 2501.14686, arXiv.org, revised Sep 2026.
    3. Yi‐Chun Chen & Gaoji Hu & Xiangqian Yang, 2025. "Information Design In Allocation With Costly Verification," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 66(3), pages 1267-1285, August.
    4. Alireza Fallah & Michael I. Jordan, 2023. "Contract Design With Safety Inspections," Papers 2311.02537, arXiv.org.
    5. 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.
    6. Boris Ginzburg, 2025. "A simple model of competitive testing," Economic Inquiry, Western Economic Association International, vol. 63(3), pages 888-902, July.
    7. Erlanson, Albin & Kleiner, Andreas, 2020. "Costly verification in collective decisions," Theoretical Economics, Econometric Society, vol. 15(3), July.
    8. Li, Yunan & Zhang, Xingtan, 2024. "Collective decision through an informed mediator," Journal of Economic Theory, Elsevier, vol. 218(C).
    9. Gunhaeng Lee, 2023. "Tailored recommendations on a matching platform," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 61(4), pages 883-917, November.
    10. Deniz Kattwinkel & Alexander Winter, 2026. "Information for nothing and authority for free," Papers 2608.09409, arXiv.org.
    11. Arieh Gavious & Ella Segev, 2017. "Price Discrimination Based on Buyers’ Purchase History," Dynamic Games and Applications, Springer, vol. 7(2), pages 229-265, June.
    12. Arash Khatibi & Golshid Baharian & Banafsheh Behzad & Sheldon Jacobson, 2015. "Extensions of the sequential stochastic assignment problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(3), pages 317-340, December.
    13. 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.
    14. Mamageishvili, A. & Schlegel, J. C., 2019. "Optimal Smart Contracts with Costly Verification," Working Papers 19/13, Department of Economics, City St George's, University of London.
    15. Ian Ball & Deniz Kattwinkel, 2019. "Probabilistic Verification in Mechanism Design," Papers 1908.05556, arXiv.org, revised Jan 2025.
    16. Erlanson, Albin & Kleiner, Andreas, 2019. "A note on optimal allocation with costly verification," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 56-62.
    17. 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.
    18. David Bergman & Jason Imbrogno, 2017. "Surviving a National Football League Survivor Pool," Operations Research, INFORMS, vol. 65(5), pages 1343-1354, October.
    19. Francis Bloch & Nicolas Houy, 2012. "Optimal assignment of durable objects to successive agents," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 51(1), pages 13-33, September.
    20. Rui Sun & Yi Zhang, 2026. "Coarse Screening," Papers 2604.04405, arXiv.org.

    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:2608.10478. 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: https://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.