Computational Complexity of Stable Marriage and Stable Roommates and Their Variants

04/17/2019
by   Jiehua Chen, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset