Popular Matchings in Complete Graphs
From MaRDI portal
Publication:5090952
DOI10.4230/LIPIcs.FSTTCS.2018.17OpenAlexW3122980873MaRDI QIDQ5090952
Telikepalli Kavitha, Ágnes Cseh
Publication date: 21 July 2022
Full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2018/9916/pdf/LIPIcs-FSTTCS-2018-17.pdf
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)
Related Items (1)
Cites Work
- On the existence of stable roommate matchings
- Popular matchings of desired size
- Popular edges and dominant matchings
- Three-sided stable matchings with cyclic preferences
- The Geometry of Fractional Stable Matchings and Its Applications
- Core Stability in Hedonic Coalition Formation
- Popular Matchings in the Stable Marriage Problem
- A necessary and sufficient condition for the existence of a complete stable matching
- Popular Matchings in the Marriage and Roommates Problems
- Popular Mixed Matchings
- An efficient algorithm for the “stable roommates” problem
- A New Approach to Stable Matching Problems
- Popularity, Mixed Matchings, and Self-duality
- Popular Half-Integral Matchings.
- Popular Matching in Roommates Setting Is NP-hard
- Near-Popular Matchings in the Roommates Problem
- Algorithmics of Matching Under Preferences
- The complexity of satisfiability problems
- A Size-Popularity Tradeoff in the Stable Marriage Problem
- College Admissions and the Stability of Marriage
This page was built for publication: Popular Matchings in Complete Graphs
