Kidney exchange: Further utilization of donors via listed exchange
Özgür Yılmaz ()
Journal of Mathematical Economics, 2014, vol. 51, issue C, 178-186
Abstract:
There is a set of incompatible patient–donor pairs and these pairs are matched pairwise. A match between two pairs corresponds to a paired kidney donation, where pairs exchange donated kidneys, or a paired listed exchange, where the first donor donates a kidney to the deceased donor wait-list, the first patient receives the kidney of the second donor, and the second patient receives a priority on the wait-list. We characterize the set of exchanges with the maximum number of transplants from the set of pairs. This characterization generalizes the well-known Gallai–Edmonds Decomposition Theorem.
Keywords: Kidney exchange; Gallai–Edmonds Decomposition (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304406813000906
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:mateco:v:51:y:2014:i:c:p:178-186
DOI: 10.1016/j.jmateco.2013.09.007
Access Statistics for this article
Journal of Mathematical Economics is currently edited by Atsushi (A.) Kajii
More articles in Journal of Mathematical Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().