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 …

Popular matchings have recently been a subject of study in the context of the so-called
House Allocation Problem, where the objective is to match applicants to houses over which …

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 …

An input to the Popular Matching problem, in the roommates setting (as opposed to the
marriage setting), consists of a graph G (not necessarily bipartite) where each vertex ranks …

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 …

An important aspect of multi-agent systems concerns the formation of coalitions that are
stable or optimal in some well-defined way. The notion of popularity has recently received a …

We consider the problem of finding a popular matching in the Weighted Capacitated House
Allocation problem (WCHA). An instance of WCHA involves a set of agents and a set of …

An instance of the popular matching problem (POP-M) consists of a set of applicants and a
set of posts. Each applicant has a preference list that strictly ranks a subset of the posts. A …

We consider a matching problem in a bipartite graph G=(A∪ B, E) where each node in A is
an agent having preferences in partial order over her neighbors, while nodes in B are …

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 …