Popular matchings in the weighted capacitated house allocation problem

DOI10.1016/j.jda.2008.11.008zbMath1186.05119OpenAlexW2065748363MaRDI QIDQ972348

Colin T. S. Sng, David F. Manlove

Publication date: 25 May 2010

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2008.11.008

zbMATH Keywords

polynomial-time algorithmprioritiesmaximum popular matchingpopular matching problemstrict preference lists

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Transversal (matching) theory (05D15) Matching models (91B68)

Related Items (11)

Popular Matchings with Two-Sided Preferences and One-Sided Ties ⋮ The popular matching and condensation problems under matroid constraints ⋮ Popular Matchings with Ties and Matroid Constraints ⋮ On weakly and strongly popular rankings ⋮ Minimal envy and popular matchings ⋮ Popular and clan-popular \(b\)-matchings ⋮ Popular matchings with two-sided preference lists and matroid constraints ⋮ Unpopularity factor in the marriage and roommates problems ⋮ Random Popular Matchings with Incomplete Preference Lists ⋮ Weighted popular matchings ⋮ Strategy-proof popular mechanisms

Cites Work

• Unnamed Item
• Optimal popular matchings
• On the existence of stable roommate matchings
• Rank-maximal matchings
• Bounded Unpopularity Matchings
• Popular Matchings
• Weighted Popular Matchings
• Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
• Popular Matchings: Structure and Algorithms
• Popular Matchings in the Capacitated House Allocation Problem
• The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
• Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems
• Algorithms and Computation
• Dynamic Matching Markets and Voting Paths

This page was built for publication: Popular matchings in the weighted capacitated house allocation problem