<XML><RECORDS><RECORD><REFERENCE_TYPE>0</REFERENCE_TYPE><REFNUM>8773</REFNUM><AUTHORS><AUTHOR>Irving,R.W.</AUTHOR><AUTHOR>Manlove,D.F.</AUTHOR><AUTHOR>Scott,S.</AUTHOR></AUTHORS><YEAR>2008</YEAR><TITLE>The Stable Marriage Problem with Master Preference Lists</TITLE><PLACE_PUBLISHED>Discrete Applied Mathematics, volume 156</PLACE_PUBLISHED><PUBLISHER>Elsevier Science</PUBLISHER><PAGES>2959-2977</PAGES><LABEL>Irving:2008:8773</LABEL><KEYWORDS><KEYWORD>Matching; Preferences; Stability; Ties; Polynomial-time algorithm; NP-hardness</KEYWORD></KEYWORDS<ABSTRACT>We study variants of the classical stable marriage problem in which the preferences of the men or the women, or both, are derived from a <i>master</i> preference list. This models real-world matching problems in which participants are ranked according to some objective criteria. The master list(s) may be strictly ordered, or may include ties, and the lists of individuals may involve ties and may include all, or just some, of the members of the opposite sex. In fact, ties are almost inevitable in the master list if the ranking is done on the basis of a scoring scheme with a relatively small range of distinct values. We show that many of the interesting variants of stable marriage that are NP-hard remain so under very severe restrictions involving the presence of master lists, but a number of special cases can be solved in polynomial time. Under this master list model, versions of the stable marriage problem that are already solvable in polynomial time typically yield to faster and/or simpler algorithms, giving rise to simple new structural characterisations of the solutions in these cases.</ABSTRACT><URL>http://dx.doi.org/doi:10.1016/j.dam.2008.01.002</URL></RECORD></RECORDS></XML>