Marriage and Roommate

Kazuo Iwama; Shuichi Miyazaki

Home/Archive/arXiv

arXiv · 2305.12841

Marriage and Roommate

Kazuo Iwama·Shuichi Miyazaki

View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper has two objectives. One is to give a linear time algorithm that solves the stable roommates problem (i.e., obtains one stable matching) using the stable marriage problem. The idea is that a stable matching of a roommate instance $I$ is a stable matching (that however must satisfy a certain condition) of some marriage instance $I'$. $I'$ is obtained just by making two copies of $I$, one for the men's table and the other for the women's table. The second objective is to investigate the possibility of reducing the roommate problem to the marriage problem (with a one-to-one correspondence between their stable matchings) in polynomial time. For a given $I$, we construct the rotation POSET $P$ of $I'$ and then we ``halve'' it to obtain $P'$, by which we can forget the above condition and can use all the closed subsets of $P'$ for all the stable matchings of $I$. Unfortunately, this approach works (runs in polynomial time) only for restricted instances.

Explore related subjects

cs.CC cs.DS

Keep this discovery

BibTeX RIS

Kazuo Iwama, Shuichi Miyazaki. 2023-05-22. Marriage and Roommate. https://arxiv.org/abs/2305.12841

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↗