Popular Matchings in the Capacitated House Allocation Problem
From MaRDI portal
Recommendations
Cited in
(22)- Matching with indifferences: a comparison of algorithms in the context of course allocation
- Donation center location problem
- Strategy-proof popular mechanisms
- Popular and clan-popular b-matchings
- Popular matchings with two-sided preference lists and matroid constraints
- The generalized popular condensation problem
- Popular matchings in the stable marriage problem
- Popular matchings with two-sided preferences and one-sided ties
- The popular matching and condensation problems under matroid constraints
- Bounded Unpopularity Matchings
- Counting popular matchings in house allocation problems
- Popular Matchings: Structure and Algorithms
- Popular matchings with ties and matroid constraints
- Popular mixed matchings
- Weighted popular matchings
- Popularity vs maximum cardinality in the stable marriage setting
- Popular matchings with variable item copies
- Bounded unpopularity matchings
- Popular matchings: structure and algorithms
- Popular matchings with one-sided bias
- Classified rank-maximal matchings and popular matchings: algorithms and hardness
- Popular matchings in the weighted capacitated house allocation problem
This page was built for publication: Popular Matchings in the Capacitated House Allocation Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449553)
