Popularity, Mixed Matchings, and Self-Duality
From MaRDI portal
Publication:5000640
DOI10.1287/moor.2020.1063zbMath1471.90123OpenAlexW3132020210MaRDI QIDQ5000640
Telikepalli Kavitha, Chien-Chung Huang
Publication date: 15 July 2021
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.2020.1063
Related Items
Quasi-Popular Matchings, Optimality, and Extended Formulations, Finding and Recognizing Popular Coalition Structures, Popular critical matchings in the many-to-many setting, Understanding Popular Matchings via Stable Matchings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Popular mixed matchings
- On the hardness of approximating minimum vertex cover
- A solution to the random assignment problem on the full preference domain
- Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover
- Some remarks on the stable matching problem
- Linear programming brings marital bliss
- Characterization of stable matchings as extreme points of a polytope
- A new fixed point approach for stable networks and stable marriages
- Network flow and 2-satisfiability
- Stable matchings and linear inequalities
- An elementary integrality proof of Rothblum's stable matching formulation
- Popular edges and dominant matchings
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Popular matchings in the stable marriage problem
- Two problems in max-size popular matchings
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- The Geometry of Fractional Stable Matchings and Its Applications
- On Popular Random Assignments
- A necessary and sufficient condition for the existence of a complete stable matching
- Probabilistic Social Choice Based on Simple Voting Comparisons
- 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
- Odd Minimum Cut-Sets and b-Matchings
- Stable Matchings, Optimal Assignments, and Linear Programming
- A New Approach to Stable Matching Problems
- Popularity, Mixed Matchings, and Self-duality
- Popular Half-Integral Matchings.
- Consistent Probabilistic Social Choice
- Popular Matching in Roommates Setting Is NP-hard
- Popular Matchings and Limits to Tractability
- Polyhedral Aspects of Stable Marriage
- Algorithmics of Matching Under Preferences
- Integer Programming: Methods, Uses, Computations
- A Size-Popularity Tradeoff in the Stable Marriage Problem
- A Fixed-Point Approach to Stable Matchings and Some Applications
- College Admissions and the Stability of Marriage
- A new solution to the random assignment problem.
