Maximum matchings and popularity

DOI10.1137/22M1523248MaRDI QIDQ6490278zbMATH OpenFDO

Authors Telikepalli Kavitha

Publication date 23 April 2024

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

stable matchingsbipartite graphsdual certificates

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms in computer science (68W99)

Cites work

• A Fixed-Point Approach to Stable Matchings and Some Applications
• A Size-Popularity Tradeoff in the Stable Marriage Problem
• A new fixed point approach for stable networks and stable marriages
• 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 Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
• The geometry of fractional stable matchings and its applications
• Understanding popular matchings via stable matchings

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)