<XML><RECORDS><RECORD><REFERENCE_TYPE>10</REFERENCE_TYPE><REFNUM>6769</REFNUM><AUTHORS><AUTHOR>Irving,R.W.</AUTHOR><AUTHOR>Manlove,D.F.</AUTHOR><AUTHOR>Scott,S.</AUTHOR></AUTHORS><YEAR>2002</YEAR><TITLE>Strong Stability in the Hospitals/Residents Problem</TITLE><PLACE_PUBLISHED>DCS Tech Report</PLACE_PUBLISHED><PUBLISHER>Dept of Computing Science, University of Glasgow</PUBLISHER><ISBN>TR-2002-123</ISBN><LABEL>Irving:2002:6769</LABEL><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(a^2) 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><NOTES>Revised May 2005<p></NOTES></RECORD></RECORDS></XML>