<XML><RECORDS><RECORD><REFERENCE_TYPE>0</REFERENCE_TYPE><REFNUM>8559</REFNUM><AUTHORS><AUTHOR>Irving,R.W.</AUTHOR><AUTHOR>Scott,S.</AUTHOR></AUTHORS><YEAR>2007</YEAR><TITLE>The stable fixtures problem - a many-to-many extension of stable roommates</TITLE><PLACE_PUBLISHED>Discrete Applied Mathematics vol. 155</PLACE_PUBLISHED><PUBLISHER>Elsevier Science</PUBLISHER><PAGES>2118-2129</PAGES><LABEL>Irving:2007:8559</LABEL><KEYWORDS><KEYWORD>stable matching problem; many-to-many non-bipartite matching; linear-time algorithm</KEYWORD></KEYWORDS<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.</ABSTRACT></RECORD></RECORDS></XML>