Maximum matchings and popularity

DOI10.4230/LIPICS.ICALP.2021.85MaRDI QIDQ7241184zbMATH OpenFDO

Authors Telikepalli Kavitha

Publication date 12 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2021.85

zbMATH Keywords

bipartite graphsdual certificatespopular matchingsstable matchings

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

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
• scientific article; zbMATH DE number 7657254 (Why is no real title available?)
• Linear programming brings marital bliss
• Network flow and 2-satisfiability
• Polyhedral aspects of stable marriage
• Popular edges and dominant matchings
• Popular Half-Integral Matchings.
• Popular matchings and limits to tractability
• Popular matchings in the stable marriage problem
• Popular matchings with one-sided bias
• Quasi-popular Matchings, Optimality, and Extended Formulations
• Size versus stability in the marriage problem
• Some remarks on the stable matching problem
• 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

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 Q7241184)