Popular matching in roommates setting is NP-hard

Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi

Research output: Contribution to conferencePaperpeer-review

17 Scopus citations

Abstract

An input to the Popular Matching problem, in the roommates setting, consists of a graph G where each vertex ranks its neighbors in strict order, known as its preference. In the Popular Matching problem the objective is to test whether there exists a matching M?such that there is no matching M where more people (vertices) are happier (in terms of the preferences) with M than with M?. In this paper we settle the computational complexity of the Popular Matching problem in the roommates setting by showing that the problem is NP-complete. Thus, we resolve an open question that has been repeatedly and explicitly asked over the last decade.

Original languageEnglish
Pages2810-2822
Number of pages13
DOIs
StatePublished - 1 Jan 2019
Event30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019 - San Diego, United States
Duration: 6 Jan 20199 Jan 2019

Conference

Conference30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019
Country/TerritoryUnited States
CitySan Diego
Period6/01/199/01/19

Fingerprint

Dive into the research topics of 'Popular matching in roommates setting is NP-hard'. Together they form a unique fingerprint.

Cite this