Popular Matchings in Complete Graphs
\'Agnes Cseh, Telikepalli Kavitha

TL;DR
This paper investigates the computational complexity of finding popular matchings in complete graphs with strict preferences, revealing that the problem is polynomial-time solvable for odd numbers of vertices but NP-hard for even numbers.
Contribution
It proves that the popular matching problem is NP-hard in complete graphs with an even number of vertices, contrasting with its polynomial solvability for odd n.
Findings
Popular matching problem is easy for odd n.
Popular matching problem is NP-hard for even n.
Provides complexity classification for the problem.
Abstract
Our input is a complete graph on vertices where each vertex has a strict ranking of all other vertices in . Our goal is to construct a matching in that is popular. A matching is popular if does not lose a head-to-head election against any matching , where each vertex casts a vote for the matching in where it gets assigned a better partner. The popular matching problem is to decide whether a popular matching exists or not. The popular matching problem in is easy to solve for odd . Surprisingly, the problem becomes NP-hard for even , as we show here.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
