On The Communication Complexity of Finding an (Approximate) Stable Marriage

Rafail Ostrovsky; Will Rosenbaum

Home/Archive/arXiv

arXiv · 1406.1273

On The Communication Complexity of Finding an (Approximate) Stable Marriage

Rafail Ostrovsky·Will Rosenbaum

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we consider the communication complexity of protocols that compute stable matchings. We work within the context of Gale and Shapley's original stable marriage problem\cite{GS62}: $n$ men and $n$ women each privately hold a total and strict ordering on all of the members of the opposite gender. They wish to collaborate in order to find a stable matching---a pairing of the men and women such that no unmatched pair mutually prefer each other to their assigned partners in the matching. We show that any communication protocol (deterministic, nondeterministic, or randomized) that correctly ouputs a stable matching requires $\Omega(n^2)$ bits of communication. Thus, the original algorithm of Gale and Shapley is communication-optimal up to a logarithmic factor. We then introduce a "divorce metric" on the set of all matchings, which allows us to consider approximately stable matchings. We describe an efficient algorithm to compute the "distance to stability" of a given matching. We then show that even under the relaxed requirement that a protocol only yield an approximate stable matching, the $\Omega(n^2)$ communication lower bound still holds.

Explore related subjects

cs.CC cs.GT

Keep this discovery

BibTeX RIS

Rafail Ostrovsky, Will Rosenbaum. 2014-06-05. On The Communication Complexity of Finding an (Approximate) Stable Marriage. https://arxiv.org/abs/1406.1273

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗

arXiv2026

Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor

We show that there is a fixed planar graph $H$, namely the $5 \times 5$ grid, such that Max Independent Set remains NP-hard in $H$-induced-minor-free graphs. This refutes the Dallard--Milani\v{c}--\v{S}torgel conjecture and a weakening of it by Gartland and Lokshtanov, and by Korhonen.

cs.CC↗

arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗