We consider the problem of computing a maximum cardinality popular matching in a
bipartite graph G=(A∪ B, E) where each vertex u∈ A∪ B ranks its neighbors in a strict order …

Given a bipartite graph G=(A∪B,E) where each vertex ranks its neighbors in a strict order of
preference, the problem of computing a stable matching is classical and well studied. A …

We are given a bipartite graph G=(A∪B,E) where each vertex has a preference list ranking
its neighbors: In particular, every a∈A ranks its neighbors in a strict order of preference …

Our input is a complete graph G on n vertices where each vertex has a strict ranking of all
other vertices in G. The goal is to construct a matching in G that is popular. A matching M is …

Our input is a graph G=(V,E) where each vertex ranks its neighbors in a strict order of
preference. The problem is to compute a matching in G that captures the preferences of the …

We investigate the following problem: given a set of jobs and a set of people with
preferences over the jobs, what is the optimal way of matching people to jobs? Here we …

We consider an extension of the popular matching problem in this paper. The input to the
popular matching problem is a bipartite graph G=(A∪B,E), where A is a set of people, B is a …

Suppose that each member of a set of agents has a preference list of a subset of houses,
possibly involving ties, and each agent and house has their capacity denoting the maximum …

Given a bipartite graph G=(A∪ B, E) where each vertex ranks its neighbors in a strict order
of preference, we consider the problem of computing a largest matching in the set of popular …

Given a set A of n people, with each person having a preference list that ranks a subset of A
as his/her acceptable partners in order of preference, we consider the Roommates Problem …