Fast Optimal Clearing of Capped-Chain Barter Exchanges

Kidney exchange is a type of barter market where patients exchange willing but incompatible donors. These exchanges are conducted via cycles—where each incompatible patient-donor pair in the cycle both gives and receives a kidney—and chains, which are started by an altruist donor who does not need a kidney in return. Finding the best combination of cycles and chains is hard. The leading algorithms for this optimization problem use either branch and price—a combination of branch and bound and column generation—or constraint generation. We show a correctness error in the leading prior branch-and-price-based approach [Glorie et al. 2014]. We develop a provably correct fix to it, which also necessarily changes the algorithm's complexity, as well as other improvements to the search algorithm. Next, we compare our solver to the leading constraint-generation-based solver and to the best prior correct branch-and-price-based solver. We focus on the setting where chains have a length cap. A cap is desirable in practice since if even one edge in the chain fails, the rest of the chain fails: the cap precludes very long chains that are extremely unlikely to execute and instead causes the solution to have more parallel chains and cycles that are more likely to succeed. We work with the UNOS nationwide kidney exchange, which uses a chain cap. Algorithms from our group autonomously make the transplant plans for that exchange. On that real data and demographically-accurate generated data, our new solver scales significantly better than the prior leading approaches.

[1]  Vlado Perkovic,et al.  Global kidney disease , 2013, The Lancet.

[2]  D. Gamarnik,et al.  Finding long chains in kidney exchange using the traveling salesman problem , 2015, Proceedings of the National Academy of Sciences.

[3]  Vicky H. Mak-Hau On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches , 2017, J. Comb. Optim..

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

[5]  M. Utku Ünver,et al.  Dynamic Kidney Exchange , 2007 .

[6]  Tuomas Sandholm,et al.  Multi-Organ Exchange: The Whole Is Greater than the Sum of its Parts , 2014, AAAI.

[7]  Tuomas Sandholm,et al.  Online Stochastic Optimization in the Large: Application to Kidney Exchange , 2009, IJCAI.

[8]  Tuomas Sandholm,et al.  FutureMatch: Combining Human Value Judgments and Machine Learning to Match in Dynamic Environments , 2015, AAAI.

[9]  Ariel D. Procaccia,et al.  Dynamic Matching via Weighted Myopia with Application to Kidney Exchange , 2012, AAAI.

[10]  Ross P. Anderson,et al.  Stochastic models and data driven simulations for healthcare operations , 2014 .

[11]  Itai Ashlagi,et al.  A dynamic model of barter exchange , 2015, SODA.

[12]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[13]  Ariel D. Procaccia,et al.  Ignorance is Almost Bliss: Near-Optimal Stochastic Matching With Few Queries , 2014, EC.

[14]  Mohammad Akbarpour,et al.  Dynamic matching market design , 2014, EC.

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

[16]  M. Utku Ünver,et al.  A Kidney Exchange Clearinghouse in New England. , 2005, The American economic review.

[17]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

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

[19]  Ronald L. Rivest,et al.  Introduction to Algorithms, third edition , 2009 .

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

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

[22]  A. Israni,et al.  OPTN/SRTR 2011 Annual Data Report: International Data , 2013, American journal of transplantation : official journal of the American Society of Transplantation and the American Society of Transplant Surgeons.

[23]  M. Utku Ünver,et al.  Utilizing List Exchange and Nondirected Donation through ‘Chain’ Paired Kidney Donations , 2006, American journal of transplantation : official journal of the American Society of Transplantation and the American Society of Transplant Surgeons.

[24]  Ariel D. Procaccia,et al.  Harnessing the power of two crossmatches , 2013, EC '13.

[25]  Kristiaan M. Glorie,et al.  Kidney Exchange with Long Chains: An Efficient Pricing Algorithm for Clearing Barter Exchanges with Branch-and-Price , 2014, Manuf. Serv. Oper. Manag..

[26]  Pingzhong Tang,et al.  Mechanism Design and Implementation for Lung Exchange , 2015, IJCAI.

[27]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[28]  F T Rapaport,et al.  The case for a living emotionally related international kidney donor exchange registry. , 1986, Transplantation proceedings.

[29]  Alan B Leichtman,et al.  US Renal Data System 2014 Annual Data Report: Epidemiology of Kidney Disease in the United States. , 2015, American journal of kidney diseases : the official journal of the National Kidney Foundation.

[30]  Alvin E. Roth,et al.  Pairwise Kidney Exchange , 2004, J. Econ. Theory.

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

[32]  Rapaport Ft,et al.  The case for a living emotionally related international kidney donor exchange registry. , 1986 .

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