1. Pareto optimality in the kidney exchange problem
- Creator:
- Borbeľová, Viera and Cechlárová, Katarína
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- barter exchange, kidney transplantation, Pareto optimality, and NP-completeness
- Language:
- English
- Description:
- To overcome the shortage of cadaveric kidneys available for transplantation, several countries organize systematic kidney exchange programs. The kidney exchange problem can be modelled as a cooperative game between incompatible patient-donor pairs whose solutions are permutations of players representing cyclic donations. We show that the problems to decide whether a given permutation is not (weakly) Pareto optimal are NP-complete.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public