UNIVERSITY of GLASGOW

Computing at Glasgow University
 
Paper ID: 8559

The stable fixtures problem - a many-to-many extension of stable roommates
Irving,R.W. Scott,S.

Publication Type: Journal
Appeared in: Discrete Applied Mathematics vol. 155
Page Numbers : 2118-2129
Publisher: Elsevier Science
Year: 2007
ISBN/ISSN:
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: stable matching problem; many-to-many non-bipartite matching; linear-time algorithm


Bibtex entry Endnote XML