IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v197y2023i2d10.1007_s10957-023-02211-6.html
   My bibliography  Save this article

A Recourse Policy to Improve Number of Successful Transplants in Uncertain Kidney Exchange Programs

Author

Listed:
  • Mehdi Zeynivand

    (Sharif University of Technology)

  • Mehdi Najafi

    (Sharif University of Technology)

  • Mohammad Modarres Yazdi

    (Sharif University of Technology)

Abstract

Uncertainty of kidney exchange programs (KEP) is one of the main challenges that cause failure in most planned transplants to proceed to surgery. Unfortunately, this challenge usually decreases KEP performance in the real world. To face this challenge, we develop an efficient approach, consisting of scheduling methodology and recourse actions, to recover failing pairs and improve the number of successful transplants in KEPs. The developed policy can be implemented in two different schemes. The first scheme receives an optimal matching as an input and determines recourse actions and the sequence of disjoint cycles and chains for the given optimal matching. However, the second scheme does not need optimal matching. This scheme simultaneously receives the compatibility graph as input and specifies the optimal matching, cycles and chains’ schedule, and corresponding recourse actions. Moreover, we investigate the performance of the developed approach under various circumstances to validate its positive impact on KEP performance. The results demonstrate that this approach increases the number of successful transplants in KEPs and decreases the number of remaining highly sensitive and O blood type patients in the pool.

Suggested Citation

  • Mehdi Zeynivand & Mehdi Najafi & Mohammad Modarres Yazdi, 2023. "A Recourse Policy to Improve Number of Successful Transplants in Uncertain Kidney Exchange Programs," Journal of Optimization Theory and Applications, Springer, vol. 197(2), pages 476-507, May.
    • Handle: RePEc:spr:joptap:v:197:y:2023:i:2:d:10.1007_s10957-023-02211-6
    DOI: 10.1007/s10957-023-02211-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-023-02211-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-023-02211-6?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. Itai Ashlagi & David Gamarnik & Michael A. Rees & Alvin E. Roth, 2012. "The Need for (long) Chains in Kidney Exchange," NBER Working Papers 18202, National Bureau of Economic Research, Inc.
    2. Alvin E. Roth & Tayfun Sönmez, 2005. "A Kidney Exchange Clearinghouse in New England," American Economic Review, American Economic Association, vol. 95(2), pages 376-380, May.
    3. Constantino, Miguel & Klimentova, Xenia & Viana, Ana & Rais, Abdur, 2013. "New insights on integer-programming models for the kidney exchange problem," European Journal of Operational Research, Elsevier, vol. 231(1), pages 57-68.
    4. Li, Yanfeng & Xiang, Ting & Szeto, Wai Yuen, 2021. "Home health care routing and scheduling problem with the consideration of outpatient services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    5. Y. Liu & K.M. Passino, 2002. "Biomimicry of Social Foraging Bacteria for Distributed Optimization: Models, Principles, and Emergent Behaviors," Journal of Optimization Theory and Applications, Springer, vol. 115(3), pages 603-628, December.
    6. J.H. Park, 2002. "Robust Decentralized Stabilization of Uncertain Large-Scale Discrete-Time Systems with Delays," Journal of Optimization Theory and Applications, Springer, vol. 113(1), pages 105-119, April.
    7. Manon Raap & Silja Meyer-Nieberg & Stefan Pickl & Martin Zsifkovits, 2017. "Aerial Vehicle Search-Path Optimization: A Novel Method for Emergency Operations," Journal of Optimization Theory and Applications, Springer, vol. 172(3), pages 965-983, March.
    8. Tayfun Sönmez & Alvin E. Roth & M. Utku Ünver, 2007. "Efficient Kidney Exchange: Coincidence of Wants in Markets with Compatibility-Based Preferences," American Economic Review, American Economic Association, vol. 97(3), pages 828-851, June.
    9. Kristiaan M. Glorie & J. Joris van de Klundert & Albert P. M. Wagelmans, 2014. "Kidney Exchange with Long Chains: An Efficient Pricing Algorithm for Clearing Barter Exchanges with Branch-and-Price," Manufacturing & Service Operations Management, INFORMS, vol. 16(4), pages 498-512, October.
    10. Avrim Blum & John P. Dickerson & Nika Haghtalab & Ariel D. Procaccia & Tuomas Sandholm & Ankit Sharma, 2020. "Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries," Operations Research, INFORMS, vol. 68(1), pages 16-34, January.
    11. Itai Ashlagi & Alvin E. Roth, 2021. "Kidney Exchange: An Operations Perspective," Management Science, INFORMS, vol. 67(9), pages 5455-5478, September.
    12. Jeffrey D. Camm & Amitabh S. Raturi & Shigeru Tsubakitani, 1990. "Cutting Big M Down to Size," Interfaces, INFORMS, vol. 20(5), pages 61-66, October.
    13. Toulis, Panos & Parkes, David C., 2015. "Design and analysis of multi-hospital kidney exchange mechanisms using random graphs," Games and Economic Behavior, Elsevier, vol. 91(C), pages 360-382.
    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. Carvalho, Margarida & Lodi, Andrea, 2023. "A theoretical and computational equilibria analysis of a multi-player kidney exchange program," European Journal of Operational Research, Elsevier, vol. 305(1), pages 373-385.
    2. Sönmez, Tayfun & Ünver, M. Utku & Yılmaz, Özgür, 2018. "How (not) to integrate blood subtyping technology to kidney exchange," Journal of Economic Theory, Elsevier, vol. 176(C), pages 193-231.
    3. Tuan Le & Jon M. Stauffer & Bala Shetty & Chelliah Sriskandarajah, 2023. "An optimization framework for analyzing dual‐donor organ exchange," Production and Operations Management, Production and Operations Management Society, vol. 32(3), pages 740-761, March.
    4. Klimentova, Xenia & Viana, Ana & Pedroso, João Pedro & Santos, Nicolau, 2021. "Fairness models for multi-agent kidney exchange programmes," Omega, Elsevier, vol. 102(C).
    5. Tayfun Sönmez & M Utku Ünver, 2017. "Market design for living-donor organ exchanges: an economic policy perspective," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 676-704.
    6. Jorgen Kratz, 2019. "Triage in Kidney Exchange," Discussion Papers 19/04, Department of Economics, University of York.
    7. 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.
    8. Klimentova, Xenia & Biró, Péter & Viana, Ana & Costa, Virginia & Pedroso, João Pedro, 2023. "Novel integer programming models for the stable kidney exchange problem," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1391-1407.
    9. John P. Dickerson & Ariel D. Procaccia & Tuomas Sandholm, 2019. "Failure-Aware Kidney Exchange," Management Science, INFORMS, vol. 65(4), pages 1768-1791, April.
    10. Morrill, Thayer & Roth, Alvin E., 2024. "Top trading cycles," Journal of Mathematical Economics, Elsevier, vol. 112(C).
    11. Kratz, Jörgen, 2024. "Conflicting objectives in kidney exchange," Journal of Economic Theory, Elsevier, vol. 217(C).
    12. Nicolau Santos & Paolo Tubertini & Ana Viana & João Pedro Pedroso, 2017. "Kidney exchange simulation and optimization," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(12), pages 1521-1532, December.
    13. Vicky Mak-Hau, 2017. "On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 35-59, January.
    14. Li, Mengling & Riyanto, Yohanes E. & Xu, Menghan, 2023. "Prioritized organ allocation rules under compatibility constraints," Games and Economic Behavior, Elsevier, vol. 141(C), pages 403-427.
    15. Alvin E. Roth, 2010. "Marketplace Institutions Related to the Timing of Transactions," NBER Working Papers 16556, National Bureau of Economic Research, Inc.
    16. Glorie, K.M. & Wagelmans, A.P.M. & van de Klundert, J.J., 2012. "Iterative branch-and-price for hierarchical multi-criteria kidney exchange," Econometric Institute Research Papers EI 2012-11, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    17. Alvin Roth, 2008. "Deferred acceptance algorithms: history, theory, practice, and open questions," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 537-569, March.
    18. Alvin E. Roth, 2012. "Marketplace Institutions Related to the Timing of Transactions: Reply to Priest," Journal of Labor Economics, University of Chicago Press, vol. 30(2), pages 479-494.
    19. Min Zhu, 2013. "College Admissions in China : A Mechanism Design Perspective," Working Papers 1327, Groupe d'Analyse et de Théorie Economique Lyon St-Étienne (GATE Lyon St-Étienne), Université de Lyon.
    20. Zhu, Min, 2014. "College admissions in China: A mechanism design perspective," China Economic Review, Elsevier, vol. 30(C), pages 618-631.

    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:spr:joptap:v:197:y:2023:i:2:d:10.1007_s10957-023-02211-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.