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

Dynamic Pooling and Regional Participation in Deceased-Donor Organ Allocation

Author

Listed:
  • Genta Okada

Abstract

Moving from geographically fragmented to pooled waiting lists in deceased-donor organ transplantation can improve efficiency, but it raises concerns about regional fairness and participation incentives. This paper studies Pareto gains from such transitions in a multi-class queueing model with impatient agents, perishable items, and a tractable homogeneous compatibility friction. In contrast to standard approaches that emphasize static match quality or overlook regional incentives in dynamic contexts, this analysis identifies dynamic risk pooling as the primary source of Pareto improvements for regions. Pooling reduces organ waste resulting from stochastic supply-demand fluctuations, temporal mismatches, and random compatibility outcomes. Although this dynamic surplus theoretically enables Pareto improvements, a purely utilitarian policy that treats all patients equally across regions often fails to achieve these improvements when regions are asymmetric. In these situations, utilitarian redistribution removes an excessive number of organs from high-supply regions and violates their participation constraints. To address this conflict, it is demonstrated that the set of achievable utilities can be represented by mixtures of static priority index policies. Building on this structure, the Constrained Pareto Frontier Search (CPFS) is proposed as a polynomial-time procedure that computes an approximately optimal allocation policy with arbitrarily small participation-constraint violations. The results indicate that, by adjusting priority indices to ensure redistribution remains within the gains from pooled supply, demand, and compatibility risk, policymakers can achieve global efficiency while maintaining local participation incentives.

Suggested Citation

  • Genta Okada, 2026. "Dynamic Pooling and Regional Participation in Deceased-Donor Organ Allocation," Papers 2609.18147, arXiv.org, revised Nov 2026.
  • Handle: RePEc:arx:papers:2609.18147
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Francis Bloch & David Cantala, 2017. "Dynamic Assignment of Objects to Queuing Agents," Post-Print halshs-03968341, HAL.
    2. Klimentova, Xenia & Viana, Ana & Pedroso, João Pedro & Santos, Nicolau, 2021. "Fairness models for multi-agent kidney exchange programmes," Omega, Elsevier, vol. 102(C).
    3. Itai Ashlagi & Faidra Monachou & Afshin Nikzad, 2025. "Optimal Allocation via Waitlists: Simplicity Through Information Design," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 92(1), pages 40-68.
    4. Nikhil Agarwal & Itai Ashlagi & Eduardo Azevedo & Clayton R. Featherstone & Ömer Karaduman, 2019. "Market Failure in Kidney Exchange," American Economic Review, American Economic Association, vol. 109(11), pages 4026-4070, November.
    5. Francis Bloch & David Cantala, 2017. "Dynamic Assignment of Objects to Queuing Agents," American Economic Journal: Microeconomics, American Economic Association, vol. 9(1), pages 88-122, February.
    6. Frank Karsten & Marco Slikker & Geert-Jan van Houtum, 2015. "Resource Pooling and Cost Allocation Among Independent Service Providers," Operations Research, INFORMS, vol. 63(2), pages 476-488, April.
    7. Shoshana Anily & Moshe Haviv, 2010. "Cooperation in Service Systems," Operations Research, INFORMS, vol. 58(3), pages 660-673, June.
    8. , & , E., 2014. "Free riding and participation in large scale, multi-hospital kidney exchange," Theoretical Economics, Econometric Society, vol. 9(3), September.
    9. Sina Ansari & Laurens Debo & Seyed M.R. Iravani, 2025. "Scheduling policies to minimize abandonment costs in infomercial call centers," IISE Transactions, Taylor & Francis Journals, vol. 57(5), pages 524-540, May.
    10. Xuanming Su & Stefanos A. Zenios, 2006. "Recipient Choice Can Address the Efficiency-Equity Trade-off in Kidney Transplantation: A Mechanism Design Model," Management Science, INFORMS, vol. 52(11), pages 1647-1660, November.
    11. Jacob D. Leshno, 2022. "Dynamic Matching in Overloaded Waiting Lists," American Economic Review, American Economic Association, vol. 112(12), pages 3876-3910, December.
    12. Loe Schlicher & Marco Slikker & Willem van Jaarsveld & Geert-Jan van Houtum, 2020. "Core Nonemptiness of Stratified Pooling Games: A Structured Markov Decision Process Approach," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1445-1465, November.
    13. Hanlin Liu & Yimin Yu, 2022. "Incentives for Shared Services: Multiserver Queueing Systems with Priorities," Manufacturing & Service Operations Management, INFORMS, vol. 24(3), pages 1751-1759, May.
    14. Xuanming Su & Stefanos Zenios, 2004. "Patient Choice in Kidney Allocation: The Role of the Queueing Discipline," Manufacturing & Service Operations Management, INFORMS, vol. 6(4), pages 280-301, June.
    15. Francis Bloch & David Cantala, 2017. "Dynamic Assignment of Objects to Queuing Agents," PSE-Ecole d'économie de Paris (Postprint) halshs-03968341, HAL.
    16. Mohammad Akbarpour & Shengwu Li & Shayan Oveis Gharan, 2020. "Thickness and Information in Dynamic Matching Markets," Journal of Political Economy, University of Chicago Press, vol. 128(3), pages 783-815.
    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. Yeon-Koo Che, 2026. "Dynamic Market Design," Papers 2601.00155, arXiv.org.
    2. Itai Ashlagi & Alvin E. Roth, 2021. "Kidney Exchange: An Operations Perspective," Management Science, INFORMS, vol. 67(9), pages 5455-5478, September.
    3. Zhiyuan Chen & Rui & Chen & Ming Hu & Yun Zhou, 2026. "Dynamic Matching Under Patience Imbalance," Papers 2602.03995, arXiv.org.
    4. René Caldentey & Lisa Aoki Hillas & Varun Gupta, 2025. "Designing Service Menus for Bipartite Queueing Systems," Operations Research, INFORMS, vol. 73(3), pages 1496-1534, May.
    5. Philipp Afèche & René Caldentey & Varun Gupta, 2022. "On the Optimal Design of a Bipartite Matching Queueing System," Operations Research, INFORMS, vol. 70(1), pages 363-401, January.
    6. Afshin Nikzad & Philipp Strack, 2024. "Equity and Efficiency in Dynamic Matching: Extreme Waitlist Policies," Management Science, INFORMS, vol. 70(8), pages 5187-5207, August.
    7. Schummer, James, 2021. "Influencing waiting lists," Journal of Economic Theory, Elsevier, vol. 195(C).
    8. Lei, Xiaochang, 2023. "Optimal queue to minimize waste," Mathematical Social Sciences, Elsevier, vol. 123(C), pages 87-94.
    9. Refael Hassin & Adam Nathaniel, 2021. "Self-Selected Task Allocation," Manufacturing & Service Operations Management, INFORMS, vol. 23(6), pages 1669-1682, November.
    10. Mustafa Oğuz Afacan & Eray Cumbul, 2025. "Waitlist engineering in discrete object allocations with outside option," International Journal of Game Theory, Springer;Game Theory Society, vol. 54(1), pages 1-22, June.
    11. Baccara, Mariagiovanna & Lee, SangMok & Yariv, Leeat, 2023. "Task allocation and on-the-job training," Journal of Economic Theory, Elsevier, vol. 207(C).
    12. Buurma-Olsen, Jennifer & Koster, Hans R.A. & van Ommeren, Jos & Damsté, Jort Sinninghe, 2025. "Quantifying misallocation of public housing," Journal of Public Economics, Elsevier, vol. 242(C).
    13. Filip Tokarski, 2025. "Screening with tolls and damages," Papers 2508.04456, arXiv.org, revised Jul 2026.
    14. Maxey, Tyler, 2023. "Dynamic matching with transfers," Economics Letters, Elsevier, vol. 233(C).
    15. Barkel, Mathijs & Colley, Rachael & Delorme, Maxence & Manlove, David & Pettersson, William, 2026. "Operational research approaches and mathematical models for kidney exchange: A literature survey and empirical evaluation," European Journal of Operational Research, Elsevier, vol. 331(2), pages 325-350.
    16. Mertikopoulos, Panayotis & Nax, Heinrich H. & Pradelski, Bary S.R., 2024. "Quick or cheap? Breaking points in dynamic markets," Journal of Mathematical Economics, Elsevier, vol. 112(C).
    17. Benedek, Márton & Biró, Péter & Csáji, Gergely & Johnson, Matthew & Paulusma, Daniël & Ye, Xin, 2026. "Computing balanced solutions for large international kidney exchange schemes when cycle length is unbounded," European Journal of Operational Research, Elsevier, vol. 333(2), pages 567-586.
    18. Nikhil Agarwal & Eric Budish, 2021. "Market Design," NBER Working Papers 29367, National Bureau of Economic Research, Inc.
    19. Nikhil Agarwal & Itai Ashlagi & Michael A. Rees & Paulo J. Somaini & Daniel C. Waldinger, 2019. "Equilibrium Allocations under Alternative Waitlist Designs: Evidence from Deceased Donor Kidneys," NBER Working Papers 25607, National Bureau of Economic Research, Inc.
    20. Rachael Colley & David Manlove & Daniel Paulusma & Mengxiao Zhang, 2025. "Complexity and Manipulation of International Kidney Exchange Programmes with Country-Specific Parameters," Papers 2506.04092, arXiv.org, revised Jun 2025.

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