Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 53, No. 3, May-June 2005, pp. 443-455
DOI: 10.1287/opre.1040.0180
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 Su, X.
Right arrow Articles by Zenios, S. A.
Right arrow Search for Related Content

Patient Choice in Kidney Allocation: A Sequential Stochastic Assignment Model

Xuanming Su, Stefanos A. Zenios

Walter A. Haas School of Business, University of California, Berkeley, California 94720
Graduate School of Business, Stanford University, 518 Memorial Way, Stanford, California 94305

xuanming{at}haas.berkeley.edu
stefzen{at}stanford.edu

This paper investigates the effect of patient choice on kidney allocation using the following sequential stochastic assignment model. There are n transplant patients to be allocated n kidneys that will arrive sequentially. Each patient and each kidney has its own type, kidney types are random and revealed upon arrival, and the reward from allocating a kidney to a particular patient depends on both their types. Patients may choose to accept or decline any kidney offer.

The objective is to determine a kidney allocation policy that maximizes total expected reward subject to the constraint that patients will only accept offers that maximize their own expected reward. A partition policy, in which the space of kidney types is divided into different domains (each corresponding to a different patient type) and in which each kidney is allocated to the patient type corresponding to its domain, is shown to be asymptotically optimal when patients must accept all kidney offers. To reflect patient choice, an incentive compatibility condition is derived to ensure that the offers made by the allocation policy are never declined. This condition is then used to derive a "second-best" partition policy. A numerical example, based on data from the US transplantation system, demonstrates that patient choice may introduce substantial inefficiencies, but the second-best policy recovers all the losses by minimizing the variability in the type of offers expected by each patient. Thus, policy makers should explicitly recognize the effect of patient choice when designing a kidney allocation system.

Subject classifications: kidney allocation:strategic behavior; incentive compatibility; assignment models:dynamic; stochastic.
History: Received February 2002; revision received April 2004; accepted April 2004.




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 page
Operations ResearchHome page
O. Alagoz, L. M. Maillart, A. J. Schaefer, and M. S. Roberts
Determining the Acceptance of Cadaveric Livers Using an Implicit Model of the Waiting List
Operations Research, January 1, 2007; 55(1): 24 - 36.
[Abstract] [PDF]


Home page
Management ScienceHome page
X. Su and S. A. Zenios
Recipient Choice Can Address the Efficiency-Equity Trade-off in Kidney Transplantation: A Mechanism Design Model
Management Science, November 1, 2006; 52(11): 1647 - 1660.
[Abstract] [PDF]




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