@inbook{f577e837828e4346be2c6dba04581716,
title = "Some Hard Stable Marriage Problems: A Survey on Multivariate Analysis",
abstract = "We survey an emerging area of research within algorithmic game theory: multivariate analysis of games. This article surveys the landscape of work on various stable marriage problems and the use of parametrized complexity as a toolbox to study computationally hard variants of these problems. Our survey can be divided into three broad topics: strategic manipulation, maximum (minimum) sized matching in the presence of ties, and notions of fair or equitable stable matchings.",
keywords = "Multivariate analysis of games, Stable marriage problem, Stable matching",
author = "Sushmita Gupta and Sanjukta Roy and Saket Saurabh and Meirav Zehavi",
note = "Publisher Copyright: {\textcopyright} 2018, Springer Nature Singapore Pte Ltd.",
year = "2018",
month = jan,
day = "1",
doi = "10.1007/978-981-13-3059-9\_8",
language = "English",
series = "Indian Statistical Institute Series",
publisher = "Springer Science and Business Media B.V.",
pages = "141--157",
booktitle = "Indian Statistical Institute Series",
address = "Germany",
}