Management Science
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


MANAGEMENT SCIENCE
Vol. 48, No. 3, March 2002, pp. 328-342
DOI: 10.1287/mnsc.48.3.328.7732
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Zenios, S. A.
Right arrow Search for Related Content

Optimal Control of a Paired-Kidney Exchange Program

Stefanos A. Zenios

Graduate School of Business, Stanford University, Stanford, California 94305
stefzen{at}stanford.edu

Organ exchanges are expected to increase the utilization of living donors and to alleviate the critical shortage of organs for transplantation. The typical arrangement involves a direct exchange between two blood-type incompatible donor-candidate pairs. An alternate possibility is an indirect exchange between one such pair and the highest priority candidate on the regular waiting list for cadaveric organs. This paper focuses on the mix of direct and indirect exchanges that maximizes the expected total discounted quality-adjusted life years (QALY) of the candidates in the participating pairs. Direct exchanges are preferable because the candidate receives a living-donor organ instead of the inferior cadaveric organ an indirect exchange provides. However, the latter involves a shorter wait. To capture this tradeoff, we develop a double-ended queueing model for an exchange system with two types of donorcandidate pairs, and obtain an optimal dynamic exchange policy by invoking a Brownian approximation. The policy takes the form of a two-sided regulator in which new pairs will join the exchange system to wait for a direct exchange if and only if the process modeling the exchange system is within the regulator's two barriers. In all other circumstances, new pairs will participate in an indirect exchange. Expressions for the optimal barriers are obtained under a variety of assumptions about the objective function, including one of complete candidate autonomy. The analysis identifies three design principles that will amplify the likelihood of an exchange program's success. First, exchange programs must involve the coordinated activities of multiple local transplant centers to enjoy the substantial benefits of resource pooling. Second, participant wait must be controlled through indirect exchanges. Third, the program must respect participants' autonomy and weigh that autonomy against the broader goal of maximizing their overall welfare.

Key Words: Kidney transplantation; Organ exchange; Patient autonomy; Double-ended queues; Brownian approximations
History: Received: October 1, 2000;


This article has been cited by other articles:


Home page
Operations ResearchHome page
B. Sandikci, L. M. Maillart, A. J. Schaefer, O. Alagoz, and M. S. Roberts
Estimating the Patient's Price of Privacy in Liver Transplantation
Operations Research, November 1, 2008; 56(6): 1393 - 1410.
[Abstract] [PDF]


Home page
Management ScienceHome page
O. Alagoz, L. M. Maillart, A. J. Schaefer, and M. S. Roberts
Choosing Among Living-Donor and Cadaveric Livers
Management Science, November 1, 2007; 53(11): 1702 - 1715.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2002 by INFORMS.