Popularity, Mixed Matchings, and Self-Duality
From MaRDI portal
Publication:5000640
DOI10.1287/MOOR.2020.1063zbMATH Open1471.90123OpenAlexW3132020210MaRDI QIDQ5000640FDOQ5000640
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
Cites Work
- Some remarks on the stable matching problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- Title not available (Why is that?)
- Title not available (Why is that?)
- College Admissions and the Stability of Marriage
- On the hardness of approximating minimum vertex cover
- A Fixed-Point Approach to Stable Matchings and Some Applications
- Stable matchings and linear inequalities
- Integer Programming: Methods, Uses, Computations
- A new solution to the random assignment problem.
- A solution to the random assignment problem on the full preference domain
- The geometry of fractional stable matchings and its applications
- Algorithmics of Matching Under Preferences
- Odd Minimum Cut-Sets and b-Matchings
- Linear programming brings marital bliss
- Popular Matchings in the Marriage and Roommates Problems
- Title not available (Why is that?)
- Stable Matchings, Optimal Assignments, and Linear Programming
- Characterization of stable matchings as extreme points of a polytope
- Popular Matchings
- A necessary and sufficient condition for the existence of a complete stable matching
- An efficient algorithm for the “stable roommates” problem
- Popular Matchings and Limits to Tractability
- Network flow and 2-satisfiability
- Popular mixed matchings
- Probabilistic Social Choice Based on Simple Voting Comparisons
- Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover
- A new fixed point approach for stable networks and stable marriages
- On Popular Random Assignments
- A New Approach to Stable Matching Problems
- Popular matchings in the stable marriage problem
- Consistent Probabilistic Social Choice
- An elementary integrality proof of Rothblum's stable matching formulation
- Popular edges and dominant matchings
- Popular Matchings with Two-Sided Preferences and One-Sided Ties
- Polyhedral Aspects of Stable Marriage
- A Size-Popularity Tradeoff in the Stable Marriage Problem
- Popular Matching in Roommates Setting Is NP-hard
- Popularity, Mixed Matchings, and Self-duality
- Popular Half-Integral Matchings.
- Two problems in max-size popular matchings
Cited In (6)
- Finding and Recognizing Popular Coalition Structures
- Quasi-Popular Matchings, Optimality, and Extended Formulations
- Popular critical matchings in the many-to-many setting
- Understanding Popular Matchings via Stable Matchings
- Popular matchings with weighted voters
- Computational complexity of \(k\)-stable matchings
Recommendations
- Popularity, Mixed Matchings, and Self-duality 👍 👎
- The dynamics of rank-maximal and popular matchings 👍 👎
- Popular Matchings with Two-Sided Preferences and One-Sided Ties 👍 👎
- Popular Matchings with Two-Sided Preferences and One-Sided Ties 👍 👎
- Popular matchings: structure and algorithms 👍 👎
- Popular Matchings: Structure and Algorithms 👍 👎
- Optimal popular matchings 👍 👎
- Understanding Popular Matchings via Stable Matchings 👍 👎
- Many-to-one popular matchings with two-sided preferences and one-sided ties 👍 👎
This page was built for publication: Popularity, Mixed Matchings, and Self-Duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5000640)
