Jörgen Kratz, Lund University

"Triage in Kidney Exchange"


This paper studies a kidney exchange problem in which a planner sorts patients into “priority groups” based on, e.g., the urgency of their conditions or PRA scores. The planner may choose to allow cyclical exchanges, chains, altruistically unbalanced exchanges and transplants across the blood group barrier. A class of matchings called “priority group matchings” is introduced. Priority group matchings give priority to patients in higher priority groups and are always Pareto efficient no matter how patients are sorted into priority groups or how the kidney exchange program is designed by the planner. A computational method for finding priority group matchings is presented. Threshold matchings are a subclass of priority group matchings that prioritize patients above some threshold (in terms of, e.g., urgency or PRA scores). A higher threshold leads to a (weakly) higher number of transplants. Threshold matchings generalize some well-known classes of matchings, such as maximum matchings and (half-compatibility) priority matchings.

Contact person: Johan Lagerlöf