Popularity vs maximum cardinality in the stable marriage setting
From MaRDI portal
Publication:5743383
Recommendations
Cites work
- scientific article; zbMATH DE number 45086 (Why is no real title available?)
- Better and simpler approximation algorithms for the stable marriage problem
- College Admissions and the Stability of Marriage
- Optimal popular matchings
- Popular Matchings
- Popular Matchings in the Capacitated House Allocation Problem
- Popular Matchings: Structure and Algorithms
- Popular Mixed Matchings
- Popular matchings in the marriage and roommates problems
- Popular matchings in the stable marriage problem
- Size versus stability in the marriage problem
- Some remarks on the stable matching problem
- The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
- Weighted Popular Matchings
Cited in
(8)- The generalized popular condensation problem
- Classified rank-maximal matchings and popular matchings -- algorithms and hardness
- A Size-Popularity Tradeoff in the Stable Marriage Problem
- Popular matchings in the stable marriage problem
- Popular matchings with two-sided preferences and one-sided ties
- Popularity in the generalized hospital residents setting
- Two problems in max-size popular matchings
- Popular matchings in the stable marriage problem
This page was built for publication: Popularity vs maximum cardinality in the stable marriage setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743383)