Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham e-Theses
You are in:

Computing Balanced Solutions for International Kidney Exchange
Schemes

YE, XIN (2025) Computing Balanced Solutions for International Kidney Exchange
Schemes.
Doctoral thesis, Durham University.

Full text not available from this repository.
Author-imposed embargo until 21 February 2026.

Abstract

In kidney exchange programmes (KEPs) patients may swap their incompatible donors leading to cycles of kidney transplants. Nowadays, countries have begun merging their national KEPs into international KEPs (IKEPs) to increase the overall number of transplants (social welfare). To ensure the longer-term stability of IKEPs, a credit-based system is introduced. In each round, every country is prescribed a ``fair'' initial allocation of kidney transplants. The initial allocation, which is obtained by using solution concepts from cooperative game theory, is adjusted by incorporating credits from the previous round, yielding a target allocation for each country. The overall goal is to find, in each round, an optimal solution, maximizing the total number of kidney transplants that approximates the target allocation vector as close as possible.

However, the maximum exchange cycle length, denoted by $\ell$, is often restricted by logistical, practical and legal considerations. It is known that the complexity of computing an optimal solution is polynomial when $\ell=2$ or $\ell=\infty$; otherwise, it is NP-hard. It is polynomial to find an optimal solution that lexicographically minimizes the country deviations from the target allocation if $\ell=2$ is permitted. However, in practice, kidney transplants along longer cycles may be performed. To an extreme, namely, $\ell=\infty$, we show that the lexicographical minimization is only polynomial-time solvable for $\ell=\infty$ under additional conditions (assuming $P \neq NP$). Nevertheless, the fact that the optimal solutions themselves can be computed in polynomial time if $\ell = \infty$ still enables us to perform an experimental study for a large number of countries. Furthermore, $\ell=3$ is permitted in some European countries, such as UK and Netherlands. Even though computing optimal solutions for $\ell=3$ is NP-hard, we perform simulations by formulating integer linear programs (ILPs) and utilizing ILP solvers. As a whole, we perform large-scale and consistent simulation studies for $\ell=2$, $\ell=\infty$ and $\ell=3$ and examine how the transitions from $\ell = 2$ to $\ell = \infty$, and from $\ell=2$ to $\ell = 3$, affect both stability and total social welfare.

Item Type:Thesis (Doctoral)
Award:Doctor of Philosophy
Keywords:computational complexity, cooperative game theory, partitioned matching game, partitioned permutation game, international kidney exchange
Faculty and Department:Faculty of Science > Computer Science, Department of
Thesis Date:2025
Copyright:Copyright of this thesis is held by the author
Deposited On:25 Nov 2025 08:34

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitter