<XML><RECORDS><RECORD><REFERENCE_TYPE>10</REFERENCE_TYPE><REFNUM>8905</REFNUM><AUTHORS><AUTHOR>McDermid,E.J.</AUTHOR><AUTHOR>Manlove,D.F.</AUTHOR></AUTHORS><YEAR>2008</YEAR><TITLE>Keeping partners together: Algorithmic results for the Hospitals / Residents problem with couples</TITLE><PLACE_PUBLISHED>DCS Technical Report Series</PLACE_PUBLISHED><PUBLISHER>Dept of Computing Science, University of Glasgow</PUBLISHER><ISBN>TR-2008-284</ISBN><LABEL>McDermid:2008:8905</LABEL><KEYWORDS><KEYWORD>stable matching problem; NP-completeness; polynomial-time algorithm</KEYWORD></KEYWORDS<ABSTRACT>The Hospitals / Residents problem with Couples (HRC) is a generalisation of the classical Hospitals / Residents problem (HR) that is important in practical applications because it models the case where couples submit joint preference lists over pairs of hospitals (h<sub>i</sub>,h<sub>j</sub>). We consider a natural restriction of HRC in which the members of a couple have individual preference lists over hospitals, and the joint preference list of the couple is <i>consistent</i> with these individual lists in a precise sense. We give an appropriate stability definition and show that, in this context, the problem of deciding whether a stable matching exists is NP-complete, even if each resident's preference list is of length at most 3 and each hospital has capacity at most 2. However, with respect to classical (Gale-Shapley) stability, we give a linear-time algorithm to find a stable matching or report that none exists, regardless of the preference list lengths or the hospital capacities. Finally, for an alternative formulation of our restriction of HRC, which we call the <i>Hospitals / Residents problem with Sizes</i> (HRS), we give a linear-time algorithm that always finds a stable matching for the case that hospital preference lists are of length at most 2, and where hospital capacities can be arbitrary.</ABSTRACT></RECORD></RECORDS></XML>