<XML><RECORDS><RECORD><REFERENCE_TYPE>3</REFERENCE_TYPE><REFNUM>6976</REFNUM><AUTHORS><AUTHOR>Irving,R.W.</AUTHOR><AUTHOR>Manlove,D.F.</AUTHOR><AUTHOR>Scott,S.</AUTHOR></AUTHORS><YEAR>2003</YEAR><TITLE>Strong stability in the hospitals/residents problem</TITLE><PLACE_PUBLISHED>Proceedings of STACS 2003: The 20th Annual Symposium on Theoretical Aspects of Computer Science, volume 2607 of Lecture Notes in Computer Science</PLACE_PUBLISHED><PUBLISHER>Springer Verlag</PUBLISHER><PAGES>439-450</PAGES><ISBN>0302-9743</ISBN><LABEL>Irving:2003:6976</LABEL><KEYWORDS><KEYWORD>stable matching problem; strong stability; hospitals/residents problem; polynomial-time algorithm; lower bound; NP-completeness.</KEYWORD></KEYWORDS<ABSTRACT>We study a version of the well-known Hospitals/Residents problem in which participants’ preferences may involve ties or other forms of indifference. In this context, we investigate the concept of strong stability, arguing that this may be the most appropriate and desirable form of stability in many practical situations. When the indifference is in the form of ties, we describe an O(a2) algorithm to find a strongly stable matching, if one exists, where a is the number of mutually acceptable resident-hospital pairs. We also show a lower bound in this case in terms of the complexity of determining whether a bipartite graph contains a perfect matching. By way of contrast, we prove that it becomes NP-complete to determine whether a strongly stable matching exists if the preferences are allowed to be arbitrary partial orders.</ABSTRACT><URL>http://www.springerlink.com/content/cxga4kkdhe4yxlrf/?p=3b9cd59fd3344951a6d4d595c2ac11b0&pi=38</URL></RECORD></RECORDS></XML>