Show simple item record

Planning for Uncertainty and Fallbacks Can Increase the Number of Transplants in a Kidney‐Paired Donation Program

dc.contributor.authorBray, M.en_US
dc.contributor.authorWang, W.en_US
dc.contributor.authorSong, P. X.‐k.en_US
dc.contributor.authorLeichtman, A. B.en_US
dc.contributor.authorRees, M. A.en_US
dc.contributor.authorAshby, V. B.en_US
dc.contributor.authorEikstadt, R.en_US
dc.contributor.authorGoulding, A.en_US
dc.contributor.authorKalbfleisch, J. D.en_US
dc.date.accessioned2015-10-07T20:42:58Z
dc.date.available2016-12-01T14:33:05Zen
dc.date.issued2015-10en_US
dc.identifier.citationBray, M.; Wang, W.; Song, P. X.‐k. ; Leichtman, A. B.; Rees, M. A.; Ashby, V. B.; Eikstadt, R.; Goulding, A.; Kalbfleisch, J. D. (2015). "Planning for Uncertainty and Fallbacks Can Increase the Number of Transplants in a Kidneyâ Paired Donation Program." American Journal of Transplantation 15(10): 2636-2645.en_US
dc.identifier.issn1600-6135en_US
dc.identifier.issn1600-6143en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/113739
dc.publisherWiley Periodicals, Inc.en_US
dc.subject.otherkidney transplantation/nephrologyen_US
dc.subject.otherkidney transplantation: living donoren_US
dc.subject.otherhealth services and outcomes researchen_US
dc.subject.otherand donation: paired exchangeen_US
dc.subject.otherdonorsen_US
dc.subject.otherdomino transplantationen_US
dc.subject.otherclinical research/practiceen_US
dc.subject.otherClinical decision‐makingen_US
dc.titlePlanning for Uncertainty and Fallbacks Can Increase the Number of Transplants in a Kidney‐Paired Donation Programen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelMedicine (General)en_US
dc.subject.hlbtoplevelHealth Sciencesen_US
dc.description.peerreviewedPeer Revieweden_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/113739/1/ajt13413.pdf
dc.identifier.doi10.1111/ajt.13413en_US
dc.identifier.sourceAmerican Journal of Transplantationen_US
dc.identifier.citedreferenceGentry SE, Montgomery RA, Segev DL. Kidney paired donation: Fundamentals, limitations, and expansions. Am J Kidney Dis 2011; 57: 144 – 151.en_US
dc.identifier.citedreferenceRapaport FT. The case for a living emotionally related international kidney donor exchange registry. Transplant Proc 1986; 18: 5 – 9.en_US
dc.identifier.citedreferenceRoth AE, Sonmez T, Unver MU, Delmonico FL, Saidman SL. Utilizing list exchange and nondirected donation through 'chain' paired kidney donations. Am J Transplant 2006; 6: 2694 – 2705.en_US
dc.identifier.citedreferenceMontgomery RA, Gentry SE, Marks WH, et al. Domino paired kidney donation: A strategy to make best use of live non‐directed donation. Lancet 2006; 368: 419 – 421.en_US
dc.identifier.citedreferenceRoth AE, Sonmez T, Unver MU. Pairwise kidney exchange. J Econom Theory 2005; 125: 151 – 188.en_US
dc.identifier.citedreferenceWallis CB, Samy KP, Roth AE, Rees MA. Kidney paired donation. Nephrol Dial Transplant 2011; 26: 2091 – 2099.en_US
dc.identifier.citedreferencePark K, Moon JI, Kim SI, Kim YS. Exchange donor program in kidney transplantation. Transplantation 1999; 67: 336 – 338.en_US
dc.identifier.citedreferenceLi Y. Optimization and simulation of kidney paired donation programs [doctoral dissertation]. Ann Arbor, MI: University of Michigan; 2012. http://kecc.sph.umich.edu/publications.en_US
dc.identifier.citedreferenceGentry SE, Segev DL, Simmerling M, Montgomery RA. Expanding kidney paired donation through participation by compatible pairs. Am J Transplant 2007; 7: 2361 – 2370.en_US
dc.identifier.citedreferenceLi Y, Song PXK, Leichtman AB, Rees MA, Kalbfleisch JD. Decision making in kidney paired donation programs with altruistic donors. Sort (Barc) 2014; 38: 53 – 72.en_US
dc.identifier.citedreferenceGurobi Optimization, Inc. Gurobi Optimizer Reference Manual. 2015. Available from: http://www.gurobi.com.en_US
dc.identifier.citedreferenceGentry SE, Segev DL. The honeymoon phase and studies of nonsimultaneous chains in kidney‐paired donation. Am J Transplant 2011; 11: 2778 – 2779.en_US
dc.identifier.citedreferenceChen Y, Li Y, Kalbfleisch JD, Zhou Y, Leichtman A, Song PXK. Graph‐based optimization algorithm and software on kidney exchanges. IEEE Trans Biomed Eng 2012; 59: 1985 – 1991.en_US
dc.identifier.citedreferenceDickerson J, Procaccia A, Sandholm T. Failure‐aware kidney exchange. ACM Conference on Electronic Commerce (EC); 2013.en_US
dc.identifier.citedreferenceLi Y, Song PXK, Zhou Y, Leichtman A, Rees MA, Kalbfleisch JD. Optimal decisions for organ exchanges in a kidney paired donation program. Stat Biosci 2014; 6: 85 – 104.en_US
dc.identifier.citedreferenceRoth AE, Sonmez T, Unver MU. Kidney exchange. Quart J Econ 2004; 119: 457 – 488.en_US
dc.identifier.citedreferenceSegev DL, Gentry SE, Warren DS, Reeb B, Montgomery RA. Kidney paired donation and optimizing the use of live donor organs. J Am Med Assoc 2005; 293: 1883 – 1890.en_US
dc.identifier.citedreferenceRees MA, Kopke J, Pelletier R, et al. A nonsimultaneous, extended, altruistic‐donor chain. N Engl J Med 2009; 360: 1096 – 1101.en_US
dc.identifier.citedreferenceAshlagi I, Gilchrist DS, Roth AE, Rees MA. Nonsimultaneous chains and dominos in kidney‐paired donation—Revisited. Am J Transplant 2011; 11: 984 – 994.en_US
dc.identifier.citedreferenceGentry SE, Montgomery RA, Swihart BJ, Segev DL. The roles of dominos and nonsimultaneous chains in kidney paired donation. Am J Transplant 2009; 9: 1330 – 1336.en_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.