Volume 1851 of the series Lecture Notes in Computer Science pp 259271
The Hospitals/Residents Problem with Ties
 Robert W. IrvingAffiliated withDept. of Computing Science, University of Glasgow
 , David F. ManloveAffiliated withDept. of Computing Science, University of Glasgow
 , Sandy ScottAffiliated withDept. of Mathematics, University of Glasgow
Abstract
The hospitals/residents problem is an extensivelystudied manyone 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 lineartime algorithm for the problem under the strongest of these criteria, socalled superstability. Our new results have applications to largescale matching schemes, such as the National Resident Matching Program in the US, and similar schemes elsewhere.
 Title
 The Hospitals/Residents Problem with Ties
 Book Title
 Algorithm Theory  SWAT 2000
 Book Subtitle
 7th Scandinavian Workshop on Algorithm Theory Bergen, Norway, July 5–7, 2000 Proceedings
 Pages
 pp 259271
 Copyright
 2000
 DOI
 10.1007/354044985X_24
 Print ISBN
 9783540676904
 Online ISBN
 9783540449850
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 1851
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag Berlin Heidelberg
 Additional Links
 Topics
 Industry Sectors
 Authors

 Robert W. Irving ^{(4)}
 David F. Manlove ^{(4)}
 Sandy Scott ^{(5)}
 Author Affiliations

 4. Dept. of Computing Science, University of Glasgow, Glasgow G12 8QQ, Scotland
 5. Dept. of Mathematics, University of Glasgow, Glasgow G12 8QQ, Scotland
Continue reading...
To view the rest of this content please follow the download PDF link above.