Chapter

Algorithm Theory - SWAT 2000

Volume 1851 of the series Lecture Notes in Computer Science pp 259-271

Date:

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

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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 superstability. Our new results have applications to large-scale matching schemes, such as the National Resident Matching Program in the US, and similar schemes elsewhere.