A Fine-Grained View on Stable Many-To-One Matching Problems with Lower and Upper Quotas

Niclas Boehmer, Klaus Heeger

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

In the Hospital Residents problem with lower and upper quotas (HR- QLU), the goal is to find a stable matching of residents to hospitals where the number of residents matched to a hospital is either between its lower and upper quota or zero [Biró et al., TCS 2010]. We analyze this problem from a parameterized perspective using several natural parameters such as the number of hospitals and the number of residents. Moreover, we present a polynomial-time algorithm that finds a stable matching if it exists on instances with maximum lower quota two. Alongside HR- QLU, we also consider two closely related models of independent interest, namely, the special case of HR- QLU where each hospital has only a lower quota but no upper quota and the variation of HR- QLU where hospitals do not have preferences over residents, which is also known as the House Allocation problem with lower and upper quotas.

Original languageEnglish
Title of host publicationWeb and Internet Economics - 16th International Conference, WINE 2020, Proceedings
EditorsXujin Chen, Nikolai Gravin, Martin Hoefer, Ruta Mehta
PublisherSpringer Science and Business Media Deutschland GmbH
Pages31-44
Number of pages14
ISBN (Print)9783030649456
DOIs
StatePublished - 1 Jan 2020
Externally publishedYes
Event16th International Conference on Web and Internet Economics, WINE 2020 - Beijing, China
Duration: 7 Dec 202011 Dec 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12495 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th International Conference on Web and Internet Economics, WINE 2020
Country/TerritoryChina
CityBeijing
Period7/12/2011/12/20

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'A Fine-Grained View on Stable Many-To-One Matching Problems with Lower and Upper Quotas'. Together they form a unique fingerprint.

Cite this