The cycle roommates problem: a hard case of kidney exchange

DOI10.1016/j.ipl.2007.02.003zbMath1184.68271OpenAlexW2060780064MaRDI QIDQ2379931

Robert W. Irving

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.02.003

zbMATH Keywords

algorithmsstabilitycomputational complexitymatchingcombinatorial problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Trade models (91B60) Transversal (matching) theory (05D15)

Related Items (9)

Unnamed Item ⋮ The kidney exchange problem: how hard is it to find a donor? ⋮ Review of the theory of stable matchings and contract systems ⋮ Solving stable matching problems using answer set programming ⋮ Three-sided stable matchings with cyclic preferences ⋮ Circular stable matching and 3-way kidney transplant ⋮ The stable marriage problem: an interdisciplinary review from the physicist's perspective ⋮ An efficient implementation of the Gale and Shapley “propose-and-reject” algorithm ⋮ Hardness results for stable exchange problems

Cites Work

• Pairwise kidney exchange
• An efficient algorithm for the “stable roommates” problem
• The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
• College Admissions and the Stability of Marriage
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The cycle roommates problem: a hard case of kidney exchange