[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/a/bla/popmgt/v32y2023i3p740-761.html
   My bibliography  Save this article

An optimization framework for analyzing dual‐donor organ exchange

Author

Listed:
  • Tuan Le
  • Jon M. Stauffer
  • Bala Shetty
  • Chelliah Sriskandarajah
Abstract
We study an optimal matching problem in the context of dual‐donor organ exchange, where a portion of two living donors' organs are transplanted to a single patient. This dual‐donor transplant technique is becoming more widespread for lung and liver transplants. However, multiple medical compatibility criteria pose a serious challenge for matching a patient with two compatible donors. In the United States and many other countries, laws prohibit commercial (for‐profit) deals for human organs, so donor exchanges are run by nonprofit organizations connecting donors with people in need of organs, with the goal of increasing transplant matches. We propose a simple chain mechanism in dual‐donor organ exchange to increase the number of patient–dual‐donor matches, which would maximize the number of patients receiving transplants. Based on this objective, we propose a general simple chain optimization framework for finding the maximum patient matching, taking into account multiple compatibility criteria (e.g., blood type and weight), and determine the complexity status of the problem. We provide theoretical results on the structures of simple chains, as well as a polynomial time algorithm to obtain the maximum patient matching simple chain with blood type compatibility. Through a numerical study for multiple compatibility criteria, we show that in many scenarios, a simple chain substantially increases the number of patients matched with dual donors for transplants, as opposed to exchange cycles. We also address the problem of maximizing the number of patients matched for dual‐donor organ transplants via two‐way and three‐way exchange cycles, subject to donors' and recipients' medical compatibility criteria, along with a discussion of their computational complexity. Finally, we characterize the general configurations of large n‐way exchange cycles and provide theoretical insights for their structural properties. Our findings provide general optimization models for dual‐donor organ exchange operators to increase the number of patients matched for transplant, given multiple compatibility criteria. In addition, we show how exchange operators, using simple chains, can increase patient matches and reduce simultaneous surgical resource requirements over exchange cycles.

Suggested Citation

  • 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.
    • Handle: RePEc:bla:popmgt:v:32:y:2023:i:3:p:740-761
    DOI: 10.1111/poms.13896
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/poms.13896
    Download Restriction: no
    File URL: https://libkey.io/10.1111/poms.13896?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
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    3. 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.
    4. 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.
    5. Svyatoslav Trukhanov & Chitra Balasubramaniam & Balabhaskar Balasundaram & Sergiy Butenko, 2013. "Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations," Computational Optimization and Applications, Springer, vol. 56(1), pages 113-130, September.
    6. 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.
    7. 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.
    8. John P. Dickerson & Ariel D. Procaccia & Tuomas Sandholm, 2019. "Failure-Aware Kidney Exchange," Management Science, INFORMS, vol. 65(4), pages 1768-1791, April.
    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. Cheng, Yao & Yang, Zaifu, 2021. "Efficient Kidney Exchange with Dichotomous Preferences," Journal of Health Economics, Elsevier, vol. 80(C).
    3. 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.
    4. 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.
    5. Itai Ashlagi & Maximilien Burq & Patrick Jaillet & Vahideh Manshadi, 2019. "On Matching and Thickness in Heterogeneous Dynamic Markets," Operations Research, INFORMS, vol. 67(4), pages 927-949, July.
    6. Kratz, Jörgen, 2024. "Conflicting objectives in kidney exchange," Journal of Economic Theory, Elsevier, vol. 217(C).
    7. 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.
    8. 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.
    9. 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.
    10. Alvin E. Roth, 2010. "Marketplace Institutions Related to the Timing of Transactions," NBER Working Papers 16556, National Bureau of Economic Research, Inc.
    11. 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.
    12. 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.
    13. 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.
    14. Zhu, Min, 2014. "College admissions in China: A mechanism design perspective," China Economic Review, Elsevier, vol. 30(C), pages 618-631.
    15. Alvin E. Roth, 2009. "What Have We Learned from Market Design?," Innovation Policy and the Economy, University of Chicago Press, vol. 9(1), pages 79-112.
    16. Andersson, Tommy & Kratz, Jörgen, 2016. "Kidney Exchange over the Blood Group Barrier," Working Papers 2016:11, Lund University, Department of Economics, revised 29 Nov 2017.
    17. Tayfun Sönmez & Tobias B. Switzer, 2013. "Matching With (Branch‐of‐Choice) Contracts at the United States Military Academy," Econometrica, Econometric Society, vol. 81(2), pages 451-488, March.
    18. 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.
    19. Haluk Ergin & Tayfun Sönmez & M. Utku Ünver, 2020. "Efficient and Incentive‐Compatible Liver Exchange," Econometrica, Econometric Society, vol. 88(3), pages 965-1005, May.
    20. Slonim, Robert & Wang, Carmen, 2016. "Market Design for Altruistic Supply: Evidence from the Lab," IZA Discussion Papers 9650, Institute of Labor Economics (IZA).

    More about this item

    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:bla:popmgt:v:32:y:2023:i:3:p:740-761. 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: Wiley Content Delivery (email available below). General contact details of provider: http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1937-5956 .

    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.