Popular Matchings in the Hospital-Residents Problem with Two-Sided Lower Quotas
| Autor: | Nasre, Meghana, Nimbhorkar, Prajakta, Ranjan, Keshav, Sarkar, Ankita |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: | |
| DOI: | 10.4230/lipics.fsttcs.2021.30 |
| Popis: | We consider the hospital-residents problem where both hospitals and residents can have lower quotas. The input is a bipartite graph G = (���������,E), each vertex in ��������� has a strict preference ordering over its neighbors. The sets ��� and ��� denote the sets of residents and hospitals respectively. Each hospital has an upper and a lower quota denoting the maximum and minimum number of residents that can be assigned to it. Residents have upper quota equal to one, however, there may be a requirement that some residents must not be left unassigned in the output matching. We call this as the residents' lower quota. We show that whenever the set of matchings satisfying all the lower and upper quotas is non-empty, there always exists a matching that is popular among the matchings in this set. We give a polynomial-time algorithm to compute such a matching. LIPIcs, Vol. 213, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021), pages 30:1-30:21 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|