The stable fixtures problem - A many-to-many extension of stable roommates

We study a many-to-many generalisation of the well-known stable roommates problem in which each participant seeks to be matched with a number of others. We present a linear-time algorithm that determines whether a stable matching exists, and if so, returns one such matching. Key Words: stable matching problem; many-to-many non-bipartite matching; linear-time algorithm

• Type: Journal
• Year: 2007
• Where: DAM
• Authors: Robert W. Irving, Sandy Scott
• Keywords: DAM 2007, Linear-Time Algorithm, Stable Matching, Stable Roommates Problem