Kidney Exchange over the Blood Group Barrier
This talk investigates a pairwise kidney exchange program that contains patient-donor pairs where patients can receive a kidney across the blood group barrier from their own donors. Patients in such pairs gain strictly by an exchange if they are matched to a fully compatible donor. Of particular interest is the set of priority matchings where the number of patients matched to fully compatible donors is maximized among all priority matchings and where all patients that can receive a kidney across the blood group barrier from their own donors are either matched to their own donors or to fully compatible donors. The main result demonstrates that matchings in this set can be identified by solving an appropriately defined maximum weight matching problem. A simulation study also suggests that the positive effect on the total number of transplants is larger when including patients that can receive a kidney across the blood group barrier from their own donors than the effect of including altruistic donors.