AI Chat AI Image Generator AI Video Text to Speech

Computational Complexity of Stable Marriage and Stable Roommates and Their Variants

04/17/2019

∙

by Jiehua Chen, et al.

∙

∙

This paper gives an overview on and summarizes existing complexity and algorithmic results of some variants of the Stable Marriage and the Stable Roommates problems. The last section defines a list of stable matching problems mentioned in the paper. If you find any corrections, suggestions, new or missing results, please send them to jiehua.chen2@gmail.com.

page 1

page 2

page 3

page 4

research

∙ 05/06/2018

The Exact Computational Complexity of Evolutionarily Stable Strategies

While the computational complexity of many game-theoretic solution conce...

0 Vincent Conitzer, et al. ∙

research

∙ 12/10/2021

Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets

Following up on purely theoretical work of Bredereck et al. [AAAI 2020],...

0 Niclas Boehmer, et al. ∙

research

∙ 07/02/2019

Adapting Stable Matchings to Evolving Preferences

Adaptivity to changing environments and constraints is key to success in...

0 Robert Bredereck, et al. ∙

research

∙ 11/30/2022

Internal Closedness and von Neumann-Morgenstern Stability in Matching Theory: Structures and Complexity

Let G be a graph and suppose we are given, for each v ∈ V(G), a strict o...

0 Yuri Faenza, et al. ∙

research

∙ 03/11/2020

Stable variation in multidimensional competition

The Fundamental Theorem of Language Change (Yang, 2000) implies the impo...

0 Henri Kauhanen, et al. ∙

research

∙ 02/18/2019

Stable fractional matchings

We study a generalization of the classical stable matching problem that ...

0 Ioannis Caragiannis, et al. ∙

research

∙ 08/02/2022

Lattice Linear Predicate Algorithms for the Constrained Stable Marriage Problem with Ties

We apply Lattice-Linear Predicate Detection Technique to derive parallel...

0 Vijay K. Garg, et al. ∙