Individual Fairness in Kidney Exchange Programs
Keywords:Societal Impact of AI, Healthcare, Medicine & Wellness, Applications, Constraint Optimization
AbstractKidney transplant is the preferred method of treatment for patients suffering from kidney failure. However, not all patients can find a donor which matches their physiological characteristics. Kidney exchange programs (KEPs) seek to match such incompatible patient-donor pairs together, usually with the main objective of maximizing the total number of transplants. Since selecting one optimal solution translates to a decision on who receives a transplant, it has a major effect on the lives of patients. The current practice in selecting an optimal solution does not necessarily ensure fairness in the selection process. In this paper, the existence of multiple optimal plans for a KEP is explored as a mean to achieve individual fairness. We propose the use of randomized policies for selecting an optimal solution in which patients' equal opportunity to receive a transplant is promoted. Our approach gives rise to the problem of enumerating all optimal solutions, which we tackle using a hybrid of constraint programming and linear programming. The advantages of our proposed method over the common practice of using the optimal solution obtained by a solver are stressed through computational experiments. Our methodology enables decision makers to fully control KEP outcomes, overcoming any potential bias or vulnerability intrinsic to a deterministic solver.
How to Cite
Farnadi, G., St-Arnaud, W., Babaki, B., & Carvalho, M. (2021). Individual Fairness in Kidney Exchange Programs. Proceedings of the AAAI Conference on Artificial Intelligence, 35(13), 11496-11505. Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/17369
AAAI Technical Track on Philosophy and Ethics of AI