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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7276 LNCS, Issue , 2012, Pages 271-282

  Manlove, David F ^a   O'Malley, Gregg ^a  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL PROBLEM; KIDNEY EXCHANGES; LIVING DONORS; NATIONAL HEALTH SERVICES; OPTIMAL SETS; OPTIMALITY; OPTIMALITY CRITERIA; REAL DATA SETS; SHARING SCHEMES;

INTEGER PROGRAMMING; OPTIMIZATION;

ALGORITHMS;

EID: 84864375714     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-30850-5_24     Document Type: Conference Paper

References (21)

1. Abraham, D.J., Blum, A., Sandholm, T.: Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges. In: Proc. EC 2007, pp. 295-304. ACM (2007)
2. Alliance for Paired Donation, http://www.paireddonation.org
3. Ashlagi, I., Gilchrist, D.S., Roth, A.E., Rees, M.A.: Nonsimultaneous chains and dominos in kidney paired donation - revisited. American J. Transplantation 11(5), 984-994 (2011)
4. Ashlagi, I., Roth, A.: Individual rationality and participation in large scale, multi-hospital kidney exchange. In: Proc. EC 2011, pp. 321-322. ACM (2011)
5. Biró, P., Manlove, D.F., Rizzi, R.: Maximum weight cycle packing in directed graphs, with application to kidney exchange. Discrete Mathematics, Algorithms and Applications 1(4), 499-517 (2009)
6. Chen, Y., Kalbfleisch, J., Li, Y., Song, P., Zhou, Y.: Computerized platform for optimal organ allocations in kidney exchanges. In: Proc. BIOCOMP 2011 (2011)
7. Dickerson,J.,Procaccia, A.D., Sandholm, T.: Optimizing kidney exchange with transplant chains: theory and reality. In: Proc. AAMAS 2012. Springer (to apppear, 2012)
8. Johnson, R.J., Allen, J.E., Fuggle, S.V., Bradley, J.A., Rudge, C.J.: Early experience of paired living kidney donation in the United Kingdom. Transplantation 86, 1672-1677 (2008)
9. Keizer, K.M., de Klerk, M., Haase-Kromwijk, B.J.J.M., Weimar, W.: The Dutch algorithm for allocation in living donor kidney exchange. Transplantation Proc. 37, 589-591 (2005)
10. de Klerk, M., Keizer, K.M., Claas, F.H.J., Witvliet, M., Haase-Kromwijk, B.J.J.M., Weimar, W.: The Dutch national living donor kidney exchange program. American J. Transplantation 5, 2302-2305 (2005)
11. Manlove, D.F., O'Malley, G.: Paired and Altruistic Kidney Donation in the UK: Algorithms and Experimentation. Technical Report, no. TR-2012-330, University of Glasgow, School of Computing Science (2012)
12. Micali, S., Vazirani, V.V.: An O(√|V |•|E|) algorithm for finding maximum matching in general graphs. In: Proc. FOCS 1980, pp. 17-27. IEEE (1980)
13. New England Program for Kidney Exchange, http://www.nepke.org
14. NHS Blood and Transplant. Transplant. Transplant Activity Report (2010-2011), http://www.organdonation.nhs.uk/ukt/statistics/transplant activity report/current activity reports/ukt/kidney activity.pdf
15. Paired Donation Network, http://www.paireddonationnetwork.org
16. Park, K., Lee, J.H., Kim, S.I., Kim, Y.S.: Exchange living-donor kidney transplantation: Diminution ofdonor organ shortage.Transplantation Proc. 36, 2949-2951 (2004)
17. Park, K., Moon II, J., Kim II, S., Kim, Y.S.: Exchange-donor program in kidney transplantation. Transplantation Proc. 31, 356-357 (1999)
18. Roth, A.E., Sönmez, T., Utku Ünver, M.: Pairwise kidney exchange. J. Economic Theory 125, 151-188 (2005)
19. Roth, A.E., Sönmez, T., Ünver, M.U.: Efficient kidney exchange: Coincidence of wants in markets with compatibility based preferences. American Economic Review 97(3), 828-851 (2007)
20. Saidman, S.L., Roth, A.E., Sönmez, T., Ünver, M.U., Delmonico, S.L.: Increasing the opportunity of live kidney donation by matching for two and three way exchanges. Transplantation 81(5), 773-782 (2006)
21. Toulis, P., Parkes, D.C.: A random graph model of kidney exchanges: efficiency, individual-rationality and incentives. In: Proc. EC 2011, pp. 323-332. ACM (2011)