Adapting a Kidney Exchange Algorithm to Align with Human Values

The efficient allocation of limited resources is a classical problem in economics and computer science. In kidney exchanges, a central market maker allocates living kidney donors to patients in need of an organ. Patients and donors in kidney exchanges are prioritized using ad-hoc weights decided on by committee and then fed into an allocation algorithm that determines who get what---and who does not. In this paper, we provide an end-to-end methodology for estimating weights of individual participant profiles in a kidney exchange. We first elicit from human subjects a list of patient attributes they consider acceptable for the purpose of prioritizing patients (e.g., medical characteristics, lifestyle choices, and so on). Then, we ask subjects comparison queries between patient profiles and estimate weights in a principled way from their responses. We show how to use these weights in kidney exchange market clearing algorithms. We then evaluate the impact of the weights in simulations and find that the precise numerical values of the weights we computed matter little, other than the ordering of profiles that they imply. However, compared to not prioritizing patients at all, there is a significant effect, with certain classes of patients being (de)prioritized based on the human-elicited value judgments.

[1]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[2]  A. M. Turing,et al.  Computing Machinery and Intelligence , 1950, The Philosophy of Artificial Intelligence.

[3]  Ralph A. Bradley,et al.  14 Paired comparisons: Some basic procedures and examples , 1984, Nonparametric Methods.

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

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

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

[7]  C. Allen,et al.  Artificial Morality: Top-down, Bottom-up, and Hybrid Approaches , 2005, Ethics and Information Technology.

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

[9]  Péter Biró,et al.  Inapproximability of the kidney exchange problem , 2007, Inf. Process. Lett..

[10]  Trevor J. M. Bench-Capon,et al.  Argumentation in artificial intelligence , 2007, Artif. Intell..

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

[12]  C. Allen,et al.  Moral Machines: Teaching Robots Right from Wrong , 2008 .

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

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

[15]  Michael Anderson,et al.  Machine Ethics , 2011 .

[16]  Ulises Cortés,et al.  Deliberation dialogues for reasoning about safety critical actions , 2012, Autonomous Agents and Multi-Agent Systems.

[17]  D. Gamarnik,et al.  The Need for (Long) Chains in Kidney Exchange , 2012 .

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

[19]  A. Roth,et al.  Free riding and participation in large scale, multi‐hospital kidney exchange , 2014 .

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

[21]  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..

[22]  Jian Li,et al.  Egalitarian pairwise kidney exchange: fast algorithms vialinear programming and parametric flow , 2014, AAMAS.

[23]  David Sarne,et al.  Strategy-Proof and Efficient Kidney Exchange Using a Credit Mechanism , 2015, AAAI.

[24]  David C. Parkes,et al.  Design and analysis of multi-hospital kidney exchange mechanisms using random graphs , 2015, Games Econ. Behav..

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

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

[27]  Jianyang Zeng,et al.  Approximation of barter exchanges with cycle length constraints , 2016, ArXiv.

[28]  David Manlove,et al.  Position-Indexed Formulations for Kidney Exchange , 2016, EC.

[29]  Francesca Rossi,et al.  Embedding Ethical Principles in Collective Decision Support Systems , 2016, AAAI.

[30]  Edith Elkind,et al.  Rationalizations of Voting Rules , 2016, Handbook of Computational Social Choice.

[31]  Iyad Rahwan,et al.  The social dilemma of autonomous vehicles , 2015, Science.

[32]  Tony Doyle,et al.  Weapons of Math Destruction: How Big Data Increases Inequality and Threatens Democracy , 2017, Inf. Soc..

[33]  Ruosong Wang,et al.  Efficient Near-optimal Algorithms for Barter Exchange , 2017, AAMAS.

[34]  Luís Moniz Pereira,et al.  Agent Morality via Counterfactuals in Logic Programming , 2017, Bridging@CogSci.

[35]  Vincent Conitzer,et al.  Moral Decision Making Frameworks for Artificial Intelligence , 2017, ISAIM.

[36]  Toby Walsh,et al.  Mechanisms for Online Organ Matching , 2017, IJCAI.

[37]  Tuomas Sandholm,et al.  Operation Frames and Clubs in Kidney Exchange , 2017, IJCAI.

[38]  Ariel D. Procaccia,et al.  Opting Into Optimal Matchings , 2016, SODA.

[39]  Iyad Rahwan,et al.  A Voting-Based System for Ethical Decision Making , 2017, AAAI.

[40]  Holger Hermanns,et al.  From Machine Ethics To Machine Explainability and Back , 2018, International Symposium on Artificial Intelligence and Mathematics.

[41]  Jure Leskovec,et al.  Human Decisions and Machine Predictions , 2017, The quarterly journal of economics.

[42]  Matthias Scheutz,et al.  Contextual Deontic Cognitive Event Calculi for Ethically Correct Robots , 2018, ISAIM.

[43]  Tsuyoshi Murata,et al.  {m , 1934, ACML.