We consider the problem of computing matchings under two-sided preferences in the
presence of lower as well as upper-quota requirements for the resources. In the presence of …

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 …

Motivated by the serious problem that hospitals in rural areas suffer from a shortage of
residents, we study the Hospitals/Residents model in which hospitals are associated with …

We consider the many-to-many bipartite matching problem in the presence of two-sided
preferences and two-sided lower quotas. The input to our problem is a bipartite graph …

In the house allocation problem with lower and upper quotas, we are given a set of
applicants and a set of projects. Each applicant has a strictly ordered preference list over the …

We consider the problem of assigning agents to resources under the two-sided preference
list setting where resources specify an upper-quota and a lower-quota, that is, respectively …

The input of the popular roommates problem consists of a graph $ G=(V, E) $ and for each
vertex $ v\in V $, strict preferences over the neighbors of $ v $. Matching $ M $ is more …

Real-world matching scenarios, like the matching of students to courses in a university
setting, involve complex downward-feasible constraints like credit limits, time-slot constraints …

We consider the problem of matchings under two-sided preferences in the presence of
maximum as well as minimum quota requirements for the agents. This setting, studied as the …

We consider the many-to-many bipartite matching problem in the presence of two-sided
preferences and two-sided lower quotas. The input to our problem is a bipartite graph …