IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v193y2012i1p255-27110.1007-s10479-010-0691-4.html
   My bibliography  Save this article

The kidney exchange problem: How hard is it to find a donor?

Author

Listed:
  • Katarína Cechlárová
  • Vladimír Lacko

Abstract

The most effective treatment for kidney failure that is currently known is transplantation. However, the supply of kidneys from cadaveric donors does not meet the fast-growing demand and the kidney from a willing living donor (genetically or emotionally relative of the patient) is often not suitable for immunological reasons. Therefore in several countries attempts have started to organize exchanges of kidneys between incompatible patient-donor pairs. On the theoretical side, game-theoretical models have been proposed to analyze various optimality criteria for such exchanges and various search schemes have been tested. One possibility to model patients’ preferences is to take into account in the first step the suitability of the donated kidney and in the second step the length of the obtained cycle of exchanges. Although the core of such a cooperative game is always nonempty and one solution can be found by the famous Top Trading Cycles algorithm, in this paper we show that many questions concerning the structure of the core are difficult to answer. Copyright Springer Science+Business Media, LLC 2012

Suggested Citation

  • Katarína Cechlárová & Vladimír Lacko, 2012. "The kidney exchange problem: How hard is it to find a donor?," Annals of Operations Research, Springer, vol. 193(1), pages 255-271, March.
    • Handle: RePEc:spr:annopr:v:193:y:2012:i:1:p:255-271:10.1007/s10479-010-0691-4
    DOI: 10.1007/s10479-010-0691-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-010-0691-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-010-0691-4?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. 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. Antonio Romero-Medina & Katari´na Cechlárová, 2001. "Stability in coalition formation games," International Journal of Game Theory, Springer;Game Theory Society, vol. 29(4), pages 487-494.
    4. Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
    5. Roth, Alvin E., 1982. "Incentive compatibility in a market with indivisible goods," Economics Letters, Elsevier, vol. 9(2), pages 127-132.
    6. Roth, Alvin E. & Postlewaite, Andrew, 1977. "Weak versus strong domination in a market with indivisible goods," Journal of Mathematical Economics, Elsevier, vol. 4(2), pages 131-137, August.
    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. Ivan Balbuzanov & Maciej H. Kotowski, 2019. "Endowments, Exclusion, and Exchange," Econometrica, Econometric Society, vol. 87(5), pages 1663-1692, September.
    2. , & , E., 2014. "Free riding and participation in large scale, multi-hospital kidney exchange," Theoretical Economics, Econometric Society, vol. 9(3), September.
    3. Committee, Nobel Prize, 2012. "Alvin E. Roth and Lloyd S. Shapley: Stable allocations and the practice of market design," Nobel Prize in Economics documents 2012-1, Nobel Prize Committee.
    4. Ekici, Özgün, 2020. "Random mechanisms for house allocation with existing tenants," Journal of Mathematical Economics, Elsevier, vol. 89(C), pages 53-65.
    5. Nicoló, Antonio & Rodríguez-Álvarez, Carmelo, 2012. "Transplant quality and patientsʼ preferences in paired kidney exchange," Games and Economic Behavior, Elsevier, vol. 74(1), pages 299-310.
    6. Ekici, Özgün, 2013. "Reclaim-proof allocation of indivisible objects," Games and Economic Behavior, Elsevier, vol. 81(C), pages 1-10.
    7. Zhiwei Cui & Yan-An Hwang, 2017. "House exchange and residential segregation in networks," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(1), pages 125-147, March.
    8. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    9. Alcalde-Unzu, Jorge & Molis, Elena, 2011. "Exchange of indivisible goods and indifferences: The Top Trading Absorbing Sets mechanisms," Games and Economic Behavior, Elsevier, vol. 73(1), pages 1-16, September.
    10. Papai, Szilvia, 2004. "Unique stability in simple coalition formation games," Games and Economic Behavior, Elsevier, vol. 48(2), pages 337-354, August.
    11. 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.
    12. YIlmaz, Özgür, 2010. "The probabilistic serial mechanism with private endowments," Games and Economic Behavior, Elsevier, vol. 69(2), pages 475-491, July.
    13. 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.
    14. Nicolò, Antonio & Rodríguez-Álvarez, Carmelo, 2017. "Age-based preferences in paired kidney exchange," Games and Economic Behavior, Elsevier, vol. 102(C), pages 508-524.
    15. 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.
    16. Atila Abdulkadiroglu & Parag A. Pathak & Alvin E. Roth & Tayfun Sönmez, 2006. "Changing the Boston School Choice Mechanism," Boston College Working Papers in Economics 639, Boston College Department of Economics.
    17. Anno, Hidekazu, 2015. "A short proof for the characterization of the core in housing markets," Economics Letters, Elsevier, vol. 126(C), pages 66-67.
    18. Tayfun Sönmez & M. Utku Ünver, 2006. "Kidney Exchange with Good Samaritan Donors: A Characterization," Boston College Working Papers in Economics 640, Boston College Department of Economics.
    19. Sotomayor, Marilda, 2005. "An elementary non-constructive proof of the non-emptiness of the core of the Housing Market of Shapley and Scarf," Mathematical Social Sciences, Elsevier, vol. 50(3), pages 298-303, November.
    20. Ehlers, Lars, 2014. "Top trading with fixed tie-breaking in markets with indivisible goods," Journal of Economic Theory, Elsevier, vol. 151(C), pages 64-87.

    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:annopr:v:193:y:2012:i:1:p:255-271:10.1007/s10479-010-0691-4. 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.