Failure-aware kidney exchange

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2013, Pages 323-340

  Dickerson, John P ^a   Procaccia, Ariel D ^a   Sandholm, Tuomas ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

Discounted cycle cover; Fielded applications; Kidney exchange; Random graphs; Stochastic matching

Indexed keywords

COMPUTATION THEORY; ELECTRONIC COMMERCE; INTEGER PROGRAMMING; STOCHASTIC SYSTEMS;

BRANCH AND PRICE; CYCLE COVERS; KIDNEY EXCHANGES; MATCHING ALGORITHM; MODELING OF DYNAMICS; RANDOM GRAPH MODELS; RANDOM GRAPHS; STOCHASTIC MATCHING;

GRAPH THEORY;

EID: 84879741005     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2492002.2482596     Document Type: Conference Paper

References (29)

1. ABRAHAM, D., BLUM, A., and SANDHOLM, T. 2007. Clearing algorithms for barter exchange markets: Enabling nationwide kidney exchanges. In ACM Conference on Elec- tronic Commerce (EC).
2. ASHLAGI, I., FISCHER, F., KASH, I., and PROCACCIA, A. 2010. Mix and match. In ACM Conference on Electronic Commerce (EC). 305-314.
3. ASHLAGI, I., GAMARNIK, D., REES, M., and ROTH, A. 2012. The need for (long) chains in kidney exchange. NBER Working Paper No. 18202.
4. ASHLAGI, I., GILCHRIST, D., ROTH, A., and REES, M. 2011. Nonsimultaneous chains and dominos in kidney-paired donation|revisited. American Journal of Transplantation 11, 5, 984-994.
5. ASHLAGI, I., JAILLET, P., and MANSHADI, V. H. 2013. Kidney exchange in dynamic sparse heterogenous pools. In ACM Conference on Electronic Commerce (EC).
6. ASHLAGI, I. and ROTH, A. 2011. Individual rationality and participation in large scale, multi-hospital kidney exchange. In ACM Conference on Electronic Commerce (EC). 321-322.
7. AWASTHI, P. and SANDHOLM, T. 2009. Online stochastic optimization in the large: Application to kidney exchange. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI). 405-411.
8. BARNHART, C., JOHNSON, E. L., NEMHAUSER, G. L., SAVELSBERGH, M. W. P., and VANCE, P. H. 1998. Branch-and-price: Column generation for solving huge integer programs. Operations Research 46, 3, 316-329.
9. BLUM, A., GUPTA, A., PROCACCIA, A. D., and SHARMA, A. 2013. Harnessing the power of two crossmatches. In ACM Conference on Electronic Commerce (EC).
10. CHEN, Y., Li, Y., KALBFLEISCH, J. D., ZHOU, Y., LEICHTMAN, A., and SONG, P. X.- K. 2012. Graph-based optimization algorithm and software on kidney exchanges. IEEE Transactions on Biomedical Engineering 59, 1985-1991.
11. DICKERSON, J. P., PROCACCIA, A. D., and SANDHOLM, T. 2012a. Dynamic matching via weighted myopia with application to kidney exchange. In Proceedings of the National Conference on Artificial Intelligence (AAAI). 1340-1346.
12. DICKERSON, J. P., PROCACCIA, A. D., and SANDHOLM, T. 2012b. Optimizing kidney exchange with transplant chains: Theory and reality. In International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS). 711-718.
13. EDMONDS, J. 1965. Maximum matching and a polyhedron with 0, 1 vertices. J. Res. Nat. Bur. Standards B, 69, 125-130.
14. ERDOs, P. and RÉNYI, A. 1960. On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences 5, 17-61.
15. GENTRY, S., MONTGOMERY, R., SWIHART, B., and SEGEV, D. 2009. The roles of dominos and nonsimultaneous chains in kidney paired donation. American Journal of Transplan- tation 9, 6, 1330-1336.
16. GENTRY, S. E. and SEGEV, D. L. 2011. The honeymoon phase and studies of nonsimultaneous chains in kidney-paired donation. American Journal of Transplantation 11, 12, 2778-2779.
17. GOEL, G. and TRIPATHI, P. 2012. Matching with our eyes closed. In Symposium on the Foundations of Computer Science (FOCS). IEEE, 718-727.
18. JANSON, S., LUCZAK, T., and RUCINSKI, A. 2011. Random Graphs. Wiley Series in Discrete Mathematics and Optimization. Wiley.
19. Kidney Paired Donation Work Group. 2012. OPTN KPD pilot program cumulative match report (CMR) for KPD match runs: Oct 27, 2010 - Nov 12, 2012.
20. LEISHMAN, R., FORMICA, R., ANDREONI, K., FRIEDEWALD, J., SLEEMAN, E., MONSTELLO, C., STEWART, D., and SANDHOLM, T. 2013. The Organ Procurement and Transplantation Network (OPTN) Kidney Paired Donation Pilot Program (KPDPP): Review of current results. In American Transplant Congress (ATC). Talk abstract.
21. LI, Y., KALBFLEISCH, J., SONG, P. X., ZHOU, Y., LEICHTMAN, A., and REES, M. 2011. Optimization and simulation of an evolving kidney paired donation (KPD) program. Department of biostatistics working paper 90, University of Michigan. May.
22. MOLINARO, M. and RAVI, R. 2013. Kidney exchanges and the query-commit problem. Manuscript.
23. MONTGOMERY, R., GENTRY, S., MARKS, W. H., WARREN, D. S., HILLER, J., HOUP, J., ZACHARY, A. A., MELANCON, J. K., MALEY, W. R., RABB, H., SIMPKINS, C., and SEGEV, D. L. 2006. Domino paired kidney donation: a strategy to make best use of live non-directed donation. The Lancet 368, 9533, 419-421.
24. REES, M., KOPKE, J., PELLETIER, R., SEGEV, D., RUTTER, M., FABREGA, A., ROGERS, J., PANKEWYCZ, O., HILLER, J., ROTH, A., SANDHOLM, T., ÜNVER, U., and MONTGOMERY, R. 2009. A nonsimultaneous, extended, altruistic-donor chain. New England Journal of Medicine 360, 11, 1096-1101.
25. ROTH, A., SÖNMEZ, T., ÜNVER, U., DELMONICO, F., and SAIDMAN, S. 2006. Utilizing list exchange and nondirected donation through 'chain' paired kidney donations. American Journal of Transplantation 6, 2694-2705.
26. SAIDMAN, S. L., ROTH, A., SÖNMEZ, T., ÜNver, U., and DELMONICO, F. 2006. Increasing the opportunity of live kidney donation by matching for two and three way exchanges. Transplantation 81, 5, 773-782.
27. TOULIS, P. and PARKES, D. 2011. A random graph model of kidney exchanges: efficiency, individual-rationality and incentives. In ACM Conference on Electronic Commerce (EC). ACM, 323-332.
28. UNOS. United Network for Organ Sharing (UNOS). http://www.unos.org/.
29. ÜNVER, U. 2010. Dynamic kidney exchange. Review of Economic Studies 77, 1, 372-414.