Some Hard Stable Marriage Problems: A Survey on Multivariate Analysis

Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

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.

Original languageEnglish
Title of host publicationIndian Statistical Institute Series
PublisherSpringer Science and Business Media B.V.
Pages141-157
Number of pages17
DOIs
StatePublished - 1 Jan 2018
Externally publishedYes

Publication series

NameIndian Statistical Institute Series
ISSN (Print)2523-3114
ISSN (Electronic)2523-3122

Keywords

  • Multivariate analysis of games
  • Stable marriage problem
  • Stable matching

Fingerprint

Dive into the research topics of 'Some Hard Stable Marriage Problems: A Survey on Multivariate Analysis'. Together they form a unique fingerprint.

Cite this