Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges
Proceedings of the 8th ACM conference on Electronic commerce
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Individual rationality and participation in large scale, multi-hospital kidney exchange
Proceedings of the 12th ACM conference on Electronic commerce
A random graph model of kidney exchanges: efficiency, individual-rationality and incentives
Proceedings of the 12th ACM conference on Electronic commerce
Optimizing kidney exchange with transplant chains: theory and reality
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
| Hi-index | 0.00 |
We study the computational problem of identifying optimal sets of kidney exchanges in the UK. We show how to expand an integer programming-based formulation [1,19] in order to model the criteria that constitute the UK definition of optimality. The software arising from this work has been used by the National Health Service Blood and Transplant to find optimal sets of kidney exchanges for their National Living Donor Kidney Sharing Schemes since July 2008. We report on the characteristics of the solutions that have been obtained in matching runs of the scheme since this time. We then present empirical results arising from the real datasets that stem from these matching runs, with the aim of establishing the extent to which the particular optimality criteria that are present in the UK influence the structure of the solutions that are ultimately computed. A key observation is that allowing 4-way exchanges would be likely to lead to a significant number of additional transplants.