Maximum matchings and popularity
From MaRDI portal
(Redirected from Publication:6490278)
Maximum matchings and popularity (scientific article; zbMATH DE number 7836004)
Maximum matchings and popularity (scientific article; zbMATH DE number 7836004)
Cites work
- A Fixed-Point Approach to Stable Matchings and Some Applications
- A new fixed point approach for stable networks and stable marriages
- A Size-Popularity Tradeoff in the Stable Marriage Problem
- Algorithms and Computation
- Characterization of stable matchings as extreme points of a polytope
- College Admissions and the Stability of Marriage
- Concerning the maximum number of stable matchings in the stable marriage problem
- Linear programming brings marital bliss
- Network flow and 2-satisfiability
- Placement optimization in refugee resettlement
- Polyhedral aspects of stable marriage
- Popular Half-Integral Matchings.
- Popular Matchings
- Popular matchings and limits to tractability
- Popular matchings in the stable marriage problem
- Quasi-popular matchings, optimality, and extended formulations
- Size versus stability in the marriage problem
- Some remarks on the stable matching problem
- Stable Matchings, Optimal Assignments, and Linear Programming
- The geometry of fractional stable matchings and its applications
- The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
- Understanding popular matchings via stable matchings
Cited in
(3)
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)
