Popular matchings in complete graphs
From MaRDI portal
Publication:2663715
DOI10.1007/s00453-020-00791-7MaRDI QIDQ2663715
Ágnes Cseh, Telikepalli Kavitha
Publication date: 19 April 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.01112
Related Items
Cites Work
- Unnamed Item
- Popular mixed matchings
- On even and odd latin squares
- On the existence of stable roommate matchings
- Popular matchings of desired size
- Popular edges and dominant matchings
- Popular matchings in the stable marriage problem
- Three-sided stable matchings with cyclic preferences
- Two problems in max-size popular matchings
- The Geometry of Fractional Stable Matchings and Its Applications
- Core Stability in Hedonic Coalition Formation
- A necessary and sufficient condition for the existence of a complete stable matching
- Popular Matchings in the Marriage and Roommates Problems
- 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
- Quasi-popular Matchings, Optimality, and Extended Formulations
- Popular Matchings and Limits to Tractability
- 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
- On the existence of three-dimensional stable matchings with cyclic preferences
