1 May 2004 in The Quarterly Journal of Economics
Most transplanted kidneys are from cadavers, but there are also many transplants from live donors. Recently, there have started to be kidney exchanges involving two donor-patient pairs such that each donor cannot give a kidney to the intended recipient because of immunological incompatibility, but each patient can receive a kidney from the other donor. Exchanges are also made in which a donor-patient pair makes a donation to someone waiting for a cadaver kidney, in return for the patient in the pair receiving high priority for a compatible cadaver kidney when one becomes available. There are stringent legal/ethical constraints on how exchanges can be conducted. We explore how larger scale exchanges of these kinds can be arranged efficiently and incentive compatibly, within existing constraints. The problem resembles some of the “housing” problems studied in the mechanism design literature for indivisible goods, with the novel feature that while live donor kidneys can be assigned simultaneously, cadaver kidneys cannot. In addition to studying the theoretical properties of the proposed kidney exchange, we present simulation results suggesting that the welfare gains from larger scale exchange would be substantial, both in increased number of feasible live donation transplants, and in improved match quality of transplanted kidneys.
1 December 2005 in Journal of Economic Theory
1 May 2007 in American Economic Review
Patients needing kidney transplants may have donors who cannot donate to them because of blood or tissue incompatibility. Incompatible patient-donor pairs can exchange donor kidneys with other pairs only when there is a “double coincidence of wants.” Developing infrastructure to perform three-way as well as two-way exchanges will have a substantial effect on the number of transplants that can be arranged. Larger than three-way exchanges have less impact on efficiency. In a general model of type-compatible exchanges, the size of the largest exchanges required to achieve efficiency equals the number of types. (JEL C78, I12)
12 March 2009 in New England Journal of Medicine
We report a chain of 10 kidney transplantations, initiated in July 2007 by a single altruistic donor (i.e., a donor without a designated recipient) and coordinated over a period of 8 months by two large paired-donation registries. These transplantations involved six transplantation centers in five states. In the case of five of the transplantations, the donors and their coregistered recipients underwent surgery simultaneously. In the other five cases, “bridge donors” continued the chain as many as 5 months after the coregistered recipients in their own pairs had received transplants. This report of a chain of paired kidney donations, in which the transplantations were not necessarily performed simultaneously, illustrates the potential of this strategy.
1 April 2005 in American Economic Review
15 March 2006 in Transplantation
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 HLA 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 11 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.