Paper Info
Title
Recourse in Kidney Exchange Programs
Abstract
We introduce the problem of selecting patient-donor pairs in a kidney exchange program to undergo a crossmatch test, and we model this selection problem as a two-stage stochastic integer programming problem. The optimal solutions of this new formulation yield a larger expected number of realized transplants than previous approaches based on internal recourse or subset recourse. We settle the computational complexity of the selection problem by showing that it remains NP-hard even for maximum cycle length equal to two. Furthermore, we investigate to what extent different algorithmic approaches, including one based on Benders decomposition, are able to solve instances of the model. We empirically investigate the computational efficiency of this approach by solving randomly generated instances and study the corresponding running times as a function of maximum cycle length, and of the presence of nondirected donors. Summary of Contribution: This paper deals with an important and very complex issue linked to the optimization of transplant matchings in kidney exchange programs, namely, the inherent uncertainty in the assessment of compatibility between donors and recipients of transplants. Although this issue has previously received some attention in the optimization literature, most attempts to date have focused on applying recourse to solutions selected within restricted spaces. The present paper explicitly formulates the maximization of the expected number of transplants as a two-stage stochastic integer programming problem. The formulation turns out to be computationally difficulty, both from a theoretical and from a numerical perspective. Different algorithmic approaches are proposed and tested experimentally for its solution. The quality of the kidney exchanges produced by these algorithms compares favorably with that of earlier models.
Year
DOI
Venue
2022
10.1287/ijoc.2021.1099
INFORMS JOURNAL ON COMPUTING
Keywords
DocType
Volume
Benders decomposition, stochastic programming, kidney exchange, healthcare
Journal
34
Issue
ISSN
Citations 
2
1091-9856
0
PageRank 
References 
Authors
0.34
0
4
Name
Order
Citations
PageRank
Bart Smeulders183.09
Valentin Bartier200.34
Yves Crama354763.94
Frits C. R. Spieksma459158.84