In connection with an earlier paper on the exchange of live donor kidneys (Roth, S”nmez, and šnver 2004) the authors entered into discussions with New England transplant surgeons and their colleagues in the transplant community, aimed at implementing a Kidney Exchange program. In the course of those discussions it became clear that a likely first step will be to implement pairwise exchanges, between just two patient-donor pairs, as these are logistically simpler than exchanges involving more than two pairs. Furthermore, the experience of these surgeons suggests to them that patient and surgeon preferences over kidneys should be 0-1, i.e. that patients and surgeons should be indifferent among kidneys from healthy donors whose kidneys are compatible with the patient. This is because, in the United States, transplants of compatible live kidneys have about equal graft survival `robabilities, regardless of the closeness of tissue types between patient and dOnor (unless there is a rare perfect match). In the present paper we show that, although thd pairwise constraint eliminates some potential exchanges, there is a wide class of constrained-efficient mechanisms 4hat are strategy-proof when patient-donor pairs and surgeons have 0-1 preferences. This class of meahanisms includes deterministic mechanisms that would accomodate the kinds of priority setting that organ banks currently use for the allocation of cadaver organs, as well as stochastic mechanisms that allow considerations of distributive justice to be addressed.
*Published:
Roth, Alvin E., Tayfun Sonmez and M. Utku Unver. "Pairwise Kidney Exchange," Journal of Economic Theory, 2005, v125(2,Dec), 151-188.
You may purchase this paper on-line in .pdf format
from SSRN.com ($5) for electronic delivery.
Machine-readable bibliographic record -
MARC,
RIS,
BibTeX
