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. (C) 2007 Elsevier B.V. All rights reserved.