The Hospitals/Residents Problem with Lower Quotas

• Hamada, Koki

  NTT Secure Platform Laboratories, NTT Corporation

• Iwama, Kazuo

  Graduate School of InformaticsKyoto University

• Miyazaki, Shuichi

  Academic Center for Computing and Media StudiesKyoto University

Abstract

The Hospitals/Residents problem is a many-to-one extension of the stable marriage problem. In an instance, each hospital specifies a quota, i.e., an upper bound on the number of positions it provides. It is well-known that in any instance, there exists at least one stable matching, and finding one can be done in polynomial time. In this paper, we consider an extension in which each hospital specifies not only an upper bound but also a lower bound on its number of positions. In this setting, there can be instances that admit no stable matching, but the problem of asking if there is a stable matching is solvable in polynomial time. In case there is no stable matching, we consider the problem of finding a matching that is “as stable as possible”, namely, a matching with a minimum number of blocking pairs. We show that this problem is hard to approximate within the ratio of (Formula Presented) for any positive constant ϵ where H and R are the sets of hospitals and residents, respectively. We then tackle this hardness from two different angles. First, we give an exponential-time exact algorithm whose running time is (Formula Presented), where t is the number of blocking pairs in an optimal solution. Second, we consider another measure for optimization criteria, i.e., the number of residents who are involved in blocking pairs. We show that this problem is still NP-hard but has a polynomial-time (Formula Presented)-approximation algorithm.

Journal

• Algorithmica

  Algorithmica 74 (1), 440-465, 2016-01

  Springer US

Keywords

• The stable marriage problem
• The Hospitals/Residents problem
• Stable matching
• Approximation algorithm

Details

• CRID: 1050845760779566848
• NII Article ID: 120006338070
• ISSN: 01784617
• ISSN: 14320541
• DOI: 10.1007/s00453-014-9951-z
• HANDLE: 2433/226943
• Web Site: http://link.springer.com/content/pdf/10.1007/s00453-014-9951-z.pdf
• Web Site: http://link.springer.com/article/10.1007/s00453-014-9951-z/fulltext.html
• Web Site: http://link.springer.com/content/pdf/10.1007/s00453-014-9951-z
• Text Lang: en
• Article Type: journal article
• Data Source:
  • IRDB
  • Crossref
  • CiNii Articles
  • KAKEN