Triage in Kidney Exchange
Jörgen Kratz ()
Discussion Papers from Department of Economics, University of York
This paper studies a kidney exchange problem in which a planner sorts patients into "priority groups" based on, e.g., the severity of their conditions. The planner may choose to allow cyclic exchanges, chains, altruistically unbalanced exchanges and desensitization. It presents a computational method for finding a new class of matchings that give priority to patients in higher priority groups, called "priority group matchings". These matchings are always Pareto efficient no matter how patients are sorted into priority groups or how the kidney exchange program is designed by the planner. Priority group matchings generalize several classes of matchings, where different classes correspond to different ways of prioritizing patients. This includes maximum matchings and (half-compatibility) priority matchings.
Keywords: Kidney exchange; triage; priority matching; priority group; threshold matching; desensitization. (search for similar items in EconPapers)
JEL-codes: C78 D47 (search for similar items in EconPapers)
New Economics Papers: this item is included in nep-des
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
https://www.york.ac.uk/media/economics/documents/discussionpapers/2019/1904.pdf Main text (application/pdf)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:yor:yorken:19/04
Access Statistics for this paper
More papers in Discussion Papers from Department of Economics, University of York Department of Economics and Related Studies, University of York, York, YO10 5DD, United Kingdom. Contact information at EDIRC.
Bibliographic data for series maintained by Paul Hodgson ().