Abstract
Kidney exchange programs try to improve accessibility to kidney transplants by allowing incompatible patient-donor pairs to swap donors. Running such a program requires to solve an optimization problem (the Kidney Exchange Problem, or KEP) as new pairs arrive or, unfortunately, drop-off. The KEP is a stochastic online problem, and can greatly benefit from the use of anticipatory algorithms. Unfortunately, most such algorithms suffer from scalability issues due to the reliance on scenario sampling, limiting their practical applicability. Here, we recognize that the KEP allows for a sampling-free probabilistic model of future arrivals and drop-offs, which we capture via a so-called Abstract Exchange Graph (AEG). We show how an AEG-based approach can outperform sampling-based algorithms in terms of quality, while being comparable to a myopic algorithm in terms of scalability. While our current experimentation is preliminary and limited in scale, these qualities make our technique one of the few that can hope to address nation-wide programs with thousands of enrolled pairs.
The Insight Centre for Data Analytics is supported by Science Foundation Ireland under Grant Number SFI/12/RC/2289, which is co-funded under the European Regional Development Fund.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
- 2.
United States Renal Data System (USRDS), 2007: http://www.usrds.org/.
References
Abraham, D.J., Blum, A., Sandholm, T.: Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges. In: Proceedings of EC, pp. 295–304 (2007)
Alvelos, F., Klimentova, X., Rais, A., Viana, A.: A compact formulation for maximizing the expected number of transplants in kidney exchange programs. J. Phys. Conf. Ser. 616, 012011 (2015)
Anderson, R., Ashlagi, I., Gamarnik, D., Roth, A.E.: Finding long chains in kidney exchange using the traveling salesman problem. Proc. Natl. Acad. Sci. 112(3), 663–668 (2015)
Ashlagi, I., Roth, A.E.: New challenges in multihospital kidney exchange. Am. Econ. Rev. 102(3), 354–59 (2012)
Awasthi, P., Sandholm, T.: Online stochastic optimization in the large: application to kidney exchange. In: Proceedings of IJCAI, vol. 9, pp. 405–411 (2009)
Chisca, D.S., O’Sullivan, B., Lombardi, M., Milano, M.: From off-line to on-line kidney exchange optimization. In: 2018 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI). IEEE (2018)
Constantino, M., Klimentova, X., Viana, A., Rais, A.: New insights on integer-programming models for the kidney exchange problem. Eur. J. Oper. Res. 231(1), 57–68 (2013)
Dickerson, J.P., Manlove, D.F., Plaut, B., Sandholm, T., Trimble, J.: Position-indexed formulations for kidney exchange. In: Proceedings of EC, pp. 25–42. ACM (2016)
Dickerson, J.P., Procaccia, A.D., Sandholm, T.: Dynamic matching via weighted myopia with application to kidney exchange. In: Proceedings of AAAI 2012, pp. 98–100 (2012)
Dickerson, J.P., Procaccia, A.D., Sandholm, T.: Failure-aware kidney exchange. In: Proceedings of EC, pp. 323–340. ACM (2013)
Dickerson, J.P., Sandholm, T.: Liver and multi-organ exchange. Am. J. Transplant. 13, 272–273 (2013)
Dickerson, J.P., Sandholm, T.: Futurematch: combining human value judgments and machine learning to match in dynamic environments. In: Proceedings of AAAI, pp. 622–628 (2015)
Glorie, K.M., van de Klundert, J.J., Wagelmans, A.P.M.: Kidney exchange with long chains: an efficient pricing algorithm for clearing barter exchanges with branch-and-price. Manuf. Serv. Oper. Manage. 16(4), 498–512 (2014)
Hentenryck, P.V., Bent, R.: Online Stochastic Combinatorial Optimization. The MIT Press, Cambridge (2009)
Irving, R.W.: The cycle roommates problem: a hard case of kidney exchange. Inf. Process. Lett. 103(1), 1–4 (2007)
Klimentova, X., Alvelos, F., Viana, A.: A new branch-and-price approach for the kidney exchange problem. In: Murgante, B., et al. (eds.) ICCSA 2014. LNCS, vol. 8580, pp. 237–252. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-09129-7_18
Mak-Hau, V.: On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches. J. Comb. Optim. 33(1), 35–59 (2017)
Manlove, D.F., O’Malley, G.: Paired and altruistic kidney donation in the UK: algorithms and experimentation. ACM J. Exp. Algorithmics 19(1), 271–282 (2014)
Version 1.1.0 Numberjack. https://github.com/eomahony/numberjack
Pagnoncelli, B.K., Ahmed, S., Shapiro, A.: Sample average approximation method for chance constrained programming: theory and applications. J. Optim. Theory Appl. 142(2), 399–416 (2009)
Pedroso, J.P.: Maximizing expectation on vertex-disjoint cycle packing. In: Murgante, B., et al. (eds.) ICCSA 2014. LNCS, vol. 8580, pp. 32–46. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-09129-7_3
Plaut, B., Dickerson, J.P., Sandholm, T.: Fast optimal clearing of capped-chain barter exchanges. In: Proceedings of AAAI, pp. 601–607 (2016)
Saidman, S.L., Roth, A.E., Sönmez, T., Ünver, M.U., Delmonico, F.L.: Increasing the opportunity of live kidney donation by matching for two-and three-way exchanges. Transplantation 81(5), 773–782 (2006)
Santos, N., Tubertini, P., Viana, A., Pedroso, J.P.: Kidney exchange simulation and optimization. J. Oper. Res. Soc. 68(12), 1521–1532 (2017)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Chisca, D.S., Lombardi, M., Milano, M., O’Sullivan, B. (2019). A Sampling-Free Anticipatory Algorithm for the Kidney Exchange Problem. In: Rousseau, LM., Stergiou, K. (eds) Integration of Constraint Programming, Artificial Intelligence, and Operations Research. CPAIOR 2019. Lecture Notes in Computer Science(), vol 11494. Springer, Cham. https://doi.org/10.1007/978-3-030-19212-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-030-19212-9_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-19211-2
Online ISBN: 978-3-030-19212-9
eBook Packages: Computer ScienceComputer Science (R0)