Maximum matchings and popularity
From MaRDI portal
Publication:6490278
DOI10.1137/22M1523248MaRDI QIDQ6490278FDOQ6490278
Authors: Telikepalli Kavitha 
Publication date: 23 April 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms in computer science (68W99)
Cites Work
- Some remarks on the stable matching problem
- College Admissions and the Stability of Marriage
- Size versus stability in the marriage problem
- A Fixed-Point Approach to Stable Matchings and Some Applications
- Algorithms and Computation
- The geometry of fractional stable matchings and its applications
- Linear programming brings marital bliss
- Stable Matchings, Optimal Assignments, and Linear Programming
- Characterization of stable matchings as extreme points of a polytope
- Popular Matchings
- Popular matchings and limits to tractability
- Network flow and 2-satisfiability
- The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
- A new fixed point approach for stable networks and stable marriages
- Concerning the maximum number of stable matchings in the stable marriage problem
- Popular matchings in the stable marriage problem
- Polyhedral aspects of stable marriage
- A Size-Popularity Tradeoff in the Stable Marriage Problem
- Popular Half-Integral Matchings.
- Quasi-popular matchings, optimality, and extended formulations
- Understanding popular matchings via stable matchings
- Placement optimization in refugee resettlement
This page was built for publication: Maximum matchings and popularity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6490278)
