Maximising expectation of the number of transplants in kidney exchange programmes

Abstract This paper addresses the problem of maximising the expected number of transplants in kidney exchange programmes. New schemes for matching rearrangement in case of failure are presented, along with a new tree search algorithm used for the computation of optimal expected values. Extensive computational experiments demonstrate the effectiveness of the algorithm and reveal a clear superiority of a newly proposed scheme, subset-recourse, as compared to previously known approaches.

[1]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[2]  J. Kalbfleisch,et al.  Planning for Uncertainty and Fallbacks Can Increase the Number of Transplants in a Kidney‐Paired Donation Program , 2015, American journal of transplantation : official journal of the American Society of Transplantation and the American Society of Transplant Surgeons.

[3]  Yan Zhou,et al.  Graph-Based Optimization Algorithm and Software on Kidney Exchanges , 2012, IEEE Transactions on Biomedical Engineering.

[4]  David Manlove,et al.  Maximum Weight Cycle Packing in Directed Graphs, with Application to Kidney Exchange Programs , 2009, Discret. Math. Algorithms Appl..

[5]  D. Segev,et al.  Domino paired kidney donation: a strategy to make best use of live non-directed donation , 2006, The Lancet.

[6]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[7]  João Pedro Pedroso.  Maximizing Expectation on Vertex-Disjoint Cycle Packing , 2014, ICCSA.

[8]  D. Segev,et al.  The Roles of Dominos and Nonsimultaneous Chains in Kidney Paired Donation , 2009, American journal of transplantation : official journal of the American Society of Transplantation and the American Society of Transplant Surgeons.

[9]  Miguel Constantino,et al.  New insights on integer-programming models for the kidney exchange problem , 2013, Eur. J. Oper. Res..

[10]  M. Utku Ünver,et al.  Increasing the Opportunity of Live Kidney Donation by Matching for Two- and Three-Way Exchanges , 2006, Transplantation.

[11]  David Manlove,et al.  Paired and Altruistic Kidney Donation in the UK , 2015, ACM J. Exp. Algorithmics.

[12]  F. Claas,et al.  The Dutch National Living Donor Kidney Exchange Program , 2005, American journal of transplantation : official journal of the American Society of Transplantation and the American Society of Transplant Surgeons.

[13]  Ariel D. Procaccia,et al.  Optimizing kidney exchange with transplant chains: theory and reality , 2012, AAMAS.

[14]  M. Utku Ünver,et al.  A nonsimultaneous, extended, altruistic-donor chain. , 2009, The New England journal of medicine.

[15]  Albert P. M. Wagelmans,et al.  Iterative branch-and-price for hierarchical multi-criteria kidney exchange , 2012 .

[16]  Michael A Rees,et al.  Kidney paired donation. , 2011, Nephrology, dialysis, transplantation : official publication of the European Dialysis and Transplant Association - European Renal Association.

[17]  Chien-Chung Huang.  Circular Stable Matching and 3-way Kidney Transplant , 2009, Algorithmica.

[18]  Michael A Rees,et al.  Optimal Decisions for Organ Exchanges in a Kidney Paired Donation Program , 2014, Statistics in biosciences.

[19]  Robert A Montgomery,et al.  Kidney paired donation: fundamentals, limitations, and expansions. , 2011, American journal of kidney diseases : the official journal of the National Kidney Foundation.

[20]  A. Roth,et al.  Nonsimultaneous Chains and Dominos in Kidney‐ Paired Donation—Revisited , 2011, American journal of transplantation : official journal of the American Society of Transplantation and the American Society of Transplant Surgeons.

[21]  Avrim Blum,et al.  Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges , 2007, EC '07.

[22]  Ariel D. Procaccia,et al.  Failure-aware kidney exchange , 2013, EC '13.

[23]  Xenia Klimentova,et al.  A New Branch-and-Price Approach for the Kidney Exchange Problem , 2014, ICCSA.

[24]  M. Utku Ünver,et al.  Efficient Kidney Exchange: Coincidence of Wants in a Markets with Compatibility-Based Preferences , 2009 .

[25]  D. Segev,et al.  Kidney paired donation and optimizing the use of live donor organs. , 2005, JAMA.