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

05/07/2021
by   Hiromichi Goko, et al.
0

Motivated by a serious issue that hospitals in rural areas suffer from shortage of residents, we study the Hospitals/Residents model in which hospitals are associated with lower quotas and the goal is to satisfy them as much as possible. When preference lists are strict, the number of residents assigned to each hospital is the same in any stable matching due to the famous rural hospitals theorem, so there is no room for algorithmic interventions. However, when ties are introduced in preference lists, this is not the case since the number of residents may vary over stable matchings. The main focus of this paper is to investigate how much we can utilize this flexibility to aid rural hospitals, in the presence of ties. We first show that the exact optimization is NP-hard and incompatible with strategy-proofness for residents. We then propose a linear-time strategy-proof algorithm whose approximation ratio is substantially better than a naive algorithm that breaks ties arbitrarily and applies the Gale-Shapley algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/13/2022

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

To mitigate the imbalance in the number of assignees in the Hospitals/Re...
research
10/16/2019

Maximum-Size Envy-free Matchings

We consider the problem of assigning residents to hospitals when hospita...
research
02/15/2019

Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists

In the stable marriage problem (SM), a mechanism that always outputs a s...
research
04/08/2019

On popularity-based random matching markets

Stable matching in a community consisting of N men and N women is a clas...
research
10/29/2021

Minimal Envy Matchings in the Hospitals/Residents Problem with Lower Quotas

In the Hospitals/Residents problem, every hospital has an upper quota th...
research
01/08/2018

Stable Marriage with Multi-Modal Preferences

We introduce a generalized version of the famous Stable Marriage problem...
research
11/17/2017

Approximately Stable Matchings with Budget Constraints

This paper considers two-sided matching with budget constraints where on...

Please sign up or login with your details

Forgot password? Click here to reset