The hospitals/residents problem with ties

Irving, R. W., Manlove, D.F. and Scott, S. (2000) The hospitals/residents problem with ties. In: Proceedings of SWAT 2000: the 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, 5-7 July, 2000, pp. 259-271. ISBN 3-540-67690-2



Publisher's URL:


The hospitals/residents problem is an extensively-studied many-one stable matching problem. Here, we consider the hospitals/residents problem where ties are allowed in the preference lists. In this extended setting, a number of natural definitions for a stable matching arise. We present the first linear-time algorithm for the problem under the strongest of these criteria, so-called super-stability . Our new results have applications to large-scale matching schemes, such as the National Resident Matching Program in the US, and similar schemes elsewhere.

Item Type:Conference Proceedings
Glasgow Author(s) Enlighten ID:Manlove, Professor David
Authors: Irving, R. W., Manlove, D.F., and Scott, S.
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
College/School:College of Science and Engineering > School of Computing Science
Research Group:Formal Analysis, Theory and Algorithms
Publisher:Springer Verlag
Copyright Holders:© Springer-Verlag
First Published:First published in Lecture Notes in Computer Science 1851:259-271
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher.

University Staff: Request a correction | Enlighten Editors: Update this record

Project CodeAward NoProject NamePrincipal InvestigatorFunder's NameFunder RefLead Dept
436361MATCH-UP - matching under preferences - algorithms and complexityRobert IrvingEngineering & Physical Sciences Research Council (EPSRC)EP/E011993/1COM - COMPUTING SCIENCE