Computing Balanced Solutions for Large International Kidney Exchange Schemes when Cycle Length is Unbounded

Benedek, Márton and Biró, Péter and Csáji, Gergely Kál and Johnson, Matthew and Paulusma, Daniel and Ye, Xin (2024) Computing Balanced Solutions for Large International Kidney Exchange Schemes when Cycle Length is Unbounded. In: AAMAS '24. IFAAMAS, [s.l.], pp. 2153-2155. ISBN 9798400704864

Preview

Text p2153.pdf - Published Version Available under License Creative Commons Attribution. Download (940kB) | Preview

Abstract

In kidney exchange programmes (KEP) patients may swap their incompatible donors leading to cycles of kidney transplants. Countries try to merge their national patient-donor pools leading to international KEPs (IKEPs). Long-term stability of an IKEP can be achieved through a credit-based system. The goal is to find, in each round, an optimal solution that closely approximates this target allocation. We provide both theoretical and experimental results for the case where the cycle length is unbounded.

Actions (login required)

Edit Item