Article ID Journal Published Year Pages File Type
419989 Discrete Applied Mathematics 2007 12 Pages PDF
Abstract

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.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
The stable fixtures problem—A many-to-many extension of stable roommates
Authors
, ,