Popular matchings with multiple partners
From MaRDI portal
Publication:5136309
Recommendations
Cites work
- scientific article; zbMATH DE number 1617265 (Why is no real title available?)
- scientific article; zbMATH DE number 45086 (Why is no real title available?)
- scientific article; zbMATH DE number 1962834 (Why is no real title available?)
- A Size-Popularity Tradeoff in the Stable Marriage Problem
- Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
- Classified stable matching
- College Admissions and the Stability of Marriage
- Popular Half-Integral Matchings.
- Popular Matchings
- 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
- Popular mixed matchings
- Popularity in the generalized hospital residents setting
- Popularity, mixed matchings, and self-duality
- Socially stable matchings in the hospitals/residents problem
- Some remarks on the stable matching problem
- Stability and Polarization of Interests in Job Matching
- The Lattice Structure of the Set of Stable Matchings with Multiple Partners
- The hospitals/residents problem with lower quotas
- Three remarks on the many-to-many stable matching problem
Cited in
(8)- Minimal envy and popular matchings
- Solving the maximum popular matching problem with matroid constraints
- Popular matchings of desired size
- How Good Are Popular Matchings
- Finding strongly popular \(b\)-matchings in bipartite graphs
- Popular matchings with two-sided preference lists and matroid constraints
- Two problems in max-size popular matchings
- Popular matchings in the stable marriage problem
This page was built for publication: Popular matchings with multiple partners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136309)
