Increasing the opportunity of live kidney donation by matching for two- and three-way exchanges

被引:150
作者
Saidman, SL
Roth, AE
Sönmez, T
Ünver, MU
Delmonico, FL
机构
[1] Massachusetts Gen Hosp, Dept Pathol, Boston, MA 02114 USA
[2] Harvard Univ, Dept Econ, Cambridge, MA 02138 USA
[3] Harvard Univ, Sch Business, Boston, MA 02115 USA
[4] Boston Coll, Dept Econ, Chestnut Hill, MA USA
[5] Univ Pittsburgh, Dept Econ, Pittsburgh, PA 15260 USA
[6] New England Organ Bank Inc, Newton, MA USA
关键词
kidney; transplant; donor; exchange; paired;
D O I
10.1097/01.tp.0000195775.77081.25
中图分类号
R392 [医学免疫学]; Q939.91 [免疫学];
学科分类号
100102 ;
摘要
Background. To expand the opportunity for paired live donor kidney transplantation, computerized matching algorithms have been designed to identify maximal sets of compatible donor/recipient pairs from a registry of incompatible pairs submitted as candidates for transplantation. Methods. Demographic data of patients who had been evaluated for live donor kidney transplantation but found to be incompatible with their potential donor (because of ABO blood group or positive crossmatch) were submitted for computer analysis and matching. Data included ABO and H LA types of donor and recipient, %PRA and specificity of recipient alloantibody, donor/recipient relationship, and the reason the donor was incompatible. The data set used for the initial simulation included 29 patients with one donor each and 16 patients with multiple donors for a total of 45 patients and 68 donor/patient pairs. In addition, a simulation based on OPTN/SRTR data was used to further assess the practical importance of multiple exchange combinations. Results. If only exchanges involving two patient-donor pairs were allowed, a maximum of 8 patient-donor pairs in the data set could exchange kidneys. If three-way exchanges were also allowed, a maximum of I 1 pairs could exchange kidneys. Simulations with OPTN/SRTR data demonstrate that the increase in the number of potential transplants if three-way exchanges are allowed is robust, and does not depend on the particular patients in our sample. Conclusions. A computerized matching protocol can be used to identify donor/recipient pairs from a registry of incompatible pairs who can potentially enter into donor exchanges that otherwise would not readily occur.
引用
收藏
页码:773 / 782
页数:10
相关论文
共 28 条
[1]   The Boston Public School match [J].
Abdulkadiroglu, A ;
Pathak, PA ;
Roth, AE ;
Sönmez, T .
AMERICAN ECONOMIC REVIEW, 2005, 95 (02) :368-371
[2]   The New York City high school match [J].
Abdulkadiroglu, A ;
Pathak, PA ;
Roth, AE .
AMERICAN ECONOMIC REVIEW, 2005, 95 (02) :364-367
[3]   School choice:: A mechanism design approach [J].
Abdulkadiroglu, A ;
Sönmez, T .
AMERICAN ECONOMIC REVIEW, 2003, 93 (03) :729-747
[4]  
ALVIN ER, 2005, EFFICIENT KIDNEY EXC
[5]  
Cecka J M, 1995, Clin Transpl, P363
[6]   The Dutch national living donor kidney exchange program [J].
de Klerk, M ;
Keizer, KM ;
Claas, FHJ ;
Witvliet, M ;
Haase-Kromwijk, BJJM ;
Weimar, W .
AMERICAN JOURNAL OF TRANSPLANTATION, 2005, 5 (09) :2302-2305
[7]  
Delmonico FL, 2004, AM J TRANSPLANT, V4, P593
[8]   United network for organ sharing [J].
Delmonico, FL ;
Morrissey, PE ;
Lipkowitz, GS ;
Stoff, JS ;
Himmelfarb, J ;
Harmon, W ;
Pavlakis, M ;
Mah, H ;
Goguen, J ;
Luskin, R ;
Milford, E ;
Basadonna, G ;
Chobanian, M ;
Bouthot, B ;
Lorber, M ;
Rohrer, RJ .
AMERICAN JOURNAL OF TRANSPLANTATION, 2004, 4 (10) :1628-1634
[9]   Exchanging kidneys - Advances in living-donor transplantation [J].
Delmonico, FL .
NEW ENGLAND JOURNAL OF MEDICINE, 2004, 350 (18) :1812-1814
[10]   PATHS TREES AND FLOWERS [J].
EDMONDS, J .
CANADIAN JOURNAL OF MATHEMATICS, 1965, 17 (03) :449-&