Two problems in max-size popular matchings
From MaRDI portal
Publication:2415362
DOI10.1007/s00453-019-00553-0zbMath1426.91170MaRDI QIDQ2415362
Telikepalli Kavitha, Florian Brandl
Publication date: 21 May 2019
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-019-00553-0
90C05: Linear programming
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
91B68: Matching models
Related Items
Popularity, Mixed Matchings, and Self-Duality, Finding and Recognizing Popular Coalition Structures, Popular matchings in complete graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The hospitals/residents problem with lower quotas
- Popular mixed matchings
- Some remarks on the stable matching problem
- Three remarks on the many-to-many stable matching problem
- Popular matchings of desired size
- Popular edges and dominant matchings
- Popular matchings in the stable marriage problem
- Popularity in the generalized hospital residents setting
- The Geometry of Fractional Stable Matchings and Its Applications
- Socially Stable Matchings in the Hospitals/Residents Problem
- Stability and Polarization of Interests in Job Matching
- Popular Matchings with Two-Sided Preferences and One-Sided Ties
- Popular Matchings
- Popular Matchings in the Marriage and Roommates Problems
- An efficient algorithm for the “stable roommates” problem
- The Lattice Structure of the Set of Stable Matchings with Multiple Partners
- 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
- Popular Matchings and Limits to Tractability
- Algorithmics of Matching Under Preferences
- A Size-Popularity Tradeoff in the Stable Marriage Problem
- College Admissions and the Stability of Marriage
- Finding strongly popular \(b\)-matchings in bipartite graphs
