We consider the well-studied Hospital Residents (HR) problem in the presence of lower
quotas (LQ). The input instance consists of a bipartite graph $ G=(\mathcal {R}\cup\mathcal …

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 …

We study popular matchings in the many-to-many matching problem, which is given by a
graph G=(V, E) G=(V, E) and, for every agent u ∈ V u∈ V, a capacity cap (u) ≥ 1 cap (u)≥ 1 …

Our input is a bipartite graph $ G=(A\cup B, E) $ where each vertex in $ A\cup B $ has a
preference list strictly ranking its neighbors. The vertices in $ A $ and in $ B $ are called …

The concept of stable matching is substantially used in bipartite graphs with individual
preferences of the vertices. The existence of stability restricts the weight and size of the …

In this paper, we consider the Hospital Residents problem (HR) and the Hospital Residents
problem with Lower Quotas (HRLQ). In this model with two sided preferences, stability is a …

We consider the problem of finding a maximum popular matching in a many-to-many
matching setting with two-sided preferences and matroid constraints. This problem was …

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 …

We consider a matching problem in a hospitals/residents instance G, ie, a many-to-one
matching instance, where every vertex has a strict ranking of its neighbors and hospitals …

We consider a matching problem in a bipartite graph $ G $ where every vertex has a
capacity and a strict preference order on its neighbors. Furthermore, there is a cost function …