| |
|
|
Abstract: We study Pareto optimality and weak Pareto optimality in the kidney exchange game. We show that the problems to decide whether a given permutation is not Pareto optimal or whether it is not weakly Pareto optimal are NP-complete in the cases with strict as well as dichotomous preferences. Contact the authors: viera.borbelova@upjs.sk, katarina.cechlarova@upjs.sk Download PDF version of the preprint. |