Paired and altruistic kidney donation in the UK: algorithms and experimentation

We study the computational problem of identifying optimal sets of kidney exchanges in the UK. We show how to expand an integer programming-based formulation [1, 19] in order to model the criteria that constitute the UK definition of optimality. The software arising from this work has been used by the National Health Service Blood and Transplant to find optimal sets of kidney exchanges for their National Living Donor Kidney Sharing Schemes since July 2008.We report on the characteristics of the solutions that have been obtained in matching runs of the scheme since this time. We then present empirical results arising from the real datasets that stem from these matching runs, with the aim of establishing the extent to which the particular optimality criteria that are present in the UK influence the structure of the solutions that are ultimately computed. A key observation is that allowing 4-way exchanges would be likely to lead to a significant number of additional transplants

Paired and altruistic kidney donation in the UK: Algorithms and experimentation

We study the computational problem of identifying optimal sets of kidney exchanges in the UK. We show how to expand an integer programming-based formulation due to Roth et al. [2007] in order to model the criteria that constitute the UK definition of optimality. The software arising from this work has been used by the National Health Service Blood and Transplant to find optimal sets of kidney exchanges for their National Living Donor Kidney Sharing Schemes since July 2008. We report on the characteristics of the solutions that have been obtained in matching runs of the scheme since this time. We then present empirical results arising from experiments on the real datasets that stem from these matching runs, with the aim of establishing the extent to which the particular optimality criteria that are present in the UK influence the structure of the solutions that are ultimately computed. A key observation is that allowing four-way exchanges would be likely to lead to a moderate number of additional transplants

Age-Based Preferences in Paired Kidney Exchange

We consider a model of Paired Kidney Exchange (PKE) with feasibility constraints on the number of patient-donor pairs involved in exchanges. Patients' preferences are restricted so that patients prefer kidneys from compatible younger donors to kidneys from older donors. In this framework, patients with compatible donors may enroll on PKE programs to receive an organ with higher expected graft survival than that of their intended donor. PKE rules that satisfy individual rationality, eciency, and strategy-proofness necessarily select pairwise exchanges. Such rules maximize the number of transplantations among pairs with the youngest donors, and sequentially among pairs with donors of dierent age group