Computational Complexity of Stable Marriage and Stable Roommates and Their Variants
Computer Science and Game Theory
2019-04-18 v1
Abstract
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 [email protected].
Keywords
Cite
@article{arxiv.1904.08196,
title = {Computational Complexity of Stable Marriage and Stable Roommates and Their Variants},
author = {Jiehua Chen},
journal= {arXiv preprint arXiv:1904.08196},
year = {2019}
}