Popular Matching in Roommates Setting is NP-hard

Sushmita Gupta, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi. Popular Matching in Roommates Setting is NP-hard. In Timothy M. Chan, editor, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019. pages 2810-2822, SIAM, 2019. [doi]

Abstract

Abstract is missing.