The rapidly growing field of computational social choice, at the intersection of computer
science and economics, deals with the computational aspects of collective decision making …

Matching problems lie at the heart of discrete mathematics. Their rich history reaches back
over 100 years (Konig, 1916), including some milestones of complexity and algorithms, such …

The stable marriage problem is to find a matching between men and women, considering
preference lists in which each person expresses his/her preference over the members of the …

We present an algorithm for maintaining maximal matching in a graph under addition and
deletion of edges. Our algorithm is randomized and it takes expected amortized O(\logn) …

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 …

We show that the problem of predicting t steps of the 1D cellular automaton Rule 110 is P-
complete. The result is found by showing that Rule 110 simulates deterministic Turing …

We consider popular matching problems in both bipartite and non-bipartite graphs with strict
preference lists. It is known that every stable matching is a min-size popular matching. A …

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 study the problem of matching applicants to jobs under one-sided preferences; that is,
each applicant ranks a non-empty subset of jobs under an order of preference, possibly …