The Spanish Kidney Exchange Model: Study of Computation-Based Alternatives to the Current Procedure
The problem of incompatible pairs in living-donor kidney transplant can be solved using paired kidney exchange, i.e., two incompatible patient-donor pairs interchange donors, creating a cycle, which can be extended to three or even more pairs. Finding a set of cycles that maximizes the number of successful transplants is a complex task.
The Organización Nacional de Trasplantes (ONT) is responsible for donation and transplantation processes in Spain. In this paper we compare the current ONT heuristic finding-cycles procedure with an integer programming approach by means of a true-data-based empirical simulation. The obtained results show that, although the two methods provide quite different solutions, they both exhibit weak and strong points.
Work partially supported by grants TIN2015-66293-R (MINECO/FEDER, UE), TIN2016-75866-C3-3-R, TIN2013-48040-R and MPCUdG2016/055 (UdG).
- 2.Abraham, D.J., Blum, A., Sandholm, T.: Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges. In: Proceedings of the 8th ACM Conference on Electronic Commerce, pp. 295–304. ACM, New York (2007)Google Scholar
- 8.Bray, M., Wang, W., Song, P.X.K., Leichtman, A.B., Rees, M.A., Ashby, V.B., Eikstadt, R., Goulding, A., Kalbfleisch, J.D.: Planning for uncertainty and fallbacks can increase the number of transplants in a kidney-paired donation program. Am. J. Transplant. 15(10), 2636–2645 (2015)CrossRefGoogle Scholar