<XML><RECORDS><RECORD><REFERENCE_TYPE>3</REFERENCE_TYPE><REFNUM>8279</REFNUM><AUTHORS><AUTHOR>Irving,R.W.</AUTHOR><AUTHOR>Manlove,D.F.</AUTHOR><AUTHOR>O'Malley,G.</AUTHOR></AUTHORS><YEAR>2006</YEAR><TITLE>Stable Marriage with Ties and Bounded Length Preference Lists</TITLE><PLACE_PUBLISHED>Proceedings of ACiD 2006: the 2nd Algorithms and Complexity in Durham workshop, volume 7 of Texts in Algorithmics, College Publications</PLACE_PUBLISHED><PUBLISHER>N/A</PUBLISHER><PAGES>95-106</PAGES><LABEL>Irving:2006:8279</LABEL><KEYWORDS><KEYWORD>Stable marriage problem; ties; incomplete lists; NP-hardness; polynomial-time algorithm</KEYWORD></KEYWORDS<ABSTRACT>We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practical applications, such as centralised matching schemes that assign graduating medical students to their first hospital posts. In such a setting, weak stability is the most common solution concept, and it is known that weakly stable matchings can have different sizes. This motivates the problem of finding a maximum cardinality weakly stable matching, which is known to be NP-hard in general. We show that this problem is solvable in polynomial time if each man's list is of length at most 2 (even for women's lists that are of unbounded length). However if each man's list is of length at most 3, we show that the problem becomes NP-hard and not approximable within some d > 1, even if each woman's list is of length at most 4.</ABSTRACT></RECORD></RECORDS></XML>