Stable matchings, one-sided ties, and approximate popularity
From MaRDI portal
Publication:6547210
Cites work
- scientific article; zbMATH DE number 1405659 (Why is no real title available?)
- A 25/17-approximation algorithm for the stable marriage problem with one-sided ties
- A Size-Popularity Tradeoff in the Stable Marriage Problem
- A \((1 + 1/e)\)-approximation algorithm for maximum stable matching with one-sided ties and incomplete lists
- A \(1.875\)-approximation algorithm for the stable marriage problem
- Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
- Better and simpler approximation algorithms for the stable marriage problem
- College Admissions and the Stability of Marriage
- Coverings of Bipartite Graphs
- Hard variants of stable marriage.
- Improved approximation algorithms for two variants of the stable marriage problem with ties
- Maintaining Near-Popular Matchings
- Matching theory
- Maximum stable matching with one-sided ties of bounded length
- Near-popular matchings in the roommates problem
- Popular matchings and limits to tractability
- Popular matchings in the marriage and roommates problems
- Popular matchings in the stable marriage problem
- Popular matchings with two-sided preferences and one-sided ties
- Quasi-popular matchings, optimality, and extended formulations
- Size versus stability in the marriage problem
- Some remarks on the stable matching problem
- Stable matchings with one-sided ties and approximate popularity
- The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
- Two problems in max-size popular matchings
- Unpopularity factor in the marriage and roommates problems
This page was built for publication: Stable matchings, one-sided ties, and approximate popularity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547210)
