Itai Ashlagi and I have a paper in the latest issue of Theoretical Economics:
Free riding and participation in large scale, multi-hospital kidney exchange
Abstract: "As multi-hospital kidney exchange has grown, the set of players has grown from patients and surgeons to include hospitals. Hospitals can choose to enroll only their hard-to-match patient–donor pairs, while conducting easily arranged exchanges internally. This behavior has already been observed.
We show that as the population of hospitals and patients grows, the cost of making it individually rational for hospitals to participate fully becomes low in almost every large exchange pool (although the worst-case cost is very high), while the cost of failing to guarantee individual rationality is high—in lost transplants. We identify a mechanism that gives hospitals incentives to reveal all patient–donor pairs. We observe that if such a mechanism were to be implemented and hospitals enrolled all their pairs, the resulting patient pools would allow efficient matchings that could be implemented with two- and three-way exchanges."
The paper was actually written some time ago, and took a long time to publish partly because the phenomenon it identifies, the withholding of easy to match pairs by big transplant centers, was controversial among referees. It isn't controversial anymore: it's one of the clearest features of contemporary kidney exchange that the flow of incoming patients to multi-hospital kidney exchange is skewed towards the hardest to match patients. Hence the success of potentially long, non-simultaneous extended altruistic donor chains (NEAD chains), which we've explored in other papers.
Free riding and participation in large scale, multi-hospital kidney exchange
We show that as the population of hospitals and patients grows, the cost of making it individually rational for hospitals to participate fully becomes low in almost every large exchange pool (although the worst-case cost is very high), while the cost of failing to guarantee individual rationality is high—in lost transplants. We identify a mechanism that gives hospitals incentives to reveal all patient–donor pairs. We observe that if such a mechanism were to be implemented and hospitals enrolled all their pairs, the resulting patient pools would allow efficient matchings that could be implemented with two- and three-way exchanges."
The paper was actually written some time ago, and took a long time to publish partly because the phenomenon it identifies, the withholding of easy to match pairs by big transplant centers, was controversial among referees. It isn't controversial anymore: it's one of the clearest features of contemporary kidney exchange that the flow of incoming patients to multi-hospital kidney exchange is skewed towards the hardest to match patients. Hence the success of potentially long, non-simultaneous extended altruistic donor chains (NEAD chains), which we've explored in other papers.
No comments:
Post a Comment