The cycle roommates problem: a hard case of kidney exchange

Authors:
Robert W. Irving
Affiliations:
Department of Computing Science, University of Glasgow, Glasgow G12 8QQ, UK
Venue:
Information Processing Letters
Year:
2007

Citing 2
Cited 1

The structure of the stable roomate problem: efficient representation and enumeration of all stable assignments

SIAM Journal on Computing
The stable marriage problem: structure and algorithms

The stable marriage problem: structure and algorithms

Modeling stable matching problems with answer set programming

RuleML'13 Proceedings of the 7th international conference on Theory, Practice, and Applications of Rules on the Web

Quantified Score

Hi-index	0.89

Visualization

Abstract

Recently, a number of interesting algorithmic problems have arisen from the emergence, in a number of countries, of kidney exchange schemes, whereby live donors are matched with recipients according to compatibility and other considerations. One such problem can be modeled by a variant of the well-known stable roommates problem in which blocking cycles, as well as the normal blocking pairs, are significant. We show here that this variant of the stable roommates problem is NP-complete, thus solving an open question posed by Cechlarova and Lacko.