DeepAI AI Chat
Log In Sign Up

Incomplete List Setting of the Hospitals/Residents Problem with Maximally Satisfying Lower Quotas

by   Kazuhisa Makino, et al.
National Institute of Informatics
Kyoto University

To mitigate the imbalance in the number of assignees in the Hospitals/Residents problem, Goko et al. [Goko et al., Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties, Proc. STACS 2022, pp. 31:1–31:20] studied the Hospitals/Residents problem with lower quotas whose goal is to find a stable matching that satisfies lower quotas as much as possible. In their paper, preference lists are assumed to be complete, that is, the preference list of each resident (resp., hospital) is assumed to contain all the hospitals (resp., residents). In this paper, we study a more general model where preference lists may be incomplete. For four natural scenarios, we obtain maximum gaps of the best and worst solutions, approximability results, and inapproximability results.


page 1

page 2

page 3

page 4


On the (Parameterized) Complexity of Almost Stable Marriage

In the Stable Marriage problem. when the preference lists are complete, ...

Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties

Motivated by a serious issue that hospitals in rural areas suffer from s...

Envy-freeness and Relaxed Stability for Lower-Quotas : A Parameterized Perspective

We consider the problem of assigning agents to resources under the two-s...

Preference Swaps for the Stable Matching Problem

An instance I of the Stable Matching Problem (SMP) is given by a biparti...

On popularity-based random matching markets

Stable matching in a community consisting of N men and N women is a clas...

Manipulation Strategies for the Rank Maximal Matching Problem

We consider manipulation strategies for the rank-maximal matching proble...

Computing the Collection of Good Models for Rule Lists

Since the seminal paper by Breiman in 2001, who pointed out a potential ...