Popular matchings in the weighted capacitated house allocation problem

DOI10.1016/J.JDA.2008.11.008MaRDI QIDQ972348zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Popular Matchings in the Capacitated House Allocation Problem
• Weighted Popular Matchings
• Weighted popular matchings
• Counting popular matchings in house allocation problems
• Popular and Clan-Popular b-Matchings

Cites work

• scientific article; zbMATH DE number 793950 (Why is no real title available?)
• Algorithms and Computation
• Bounded Unpopularity Matchings
• Dynamic Matching Markets and Voting Paths
• Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems
• On the existence of stable roommate matchings
• Optimal popular matchings
• Popular Matchings
• Popular Matchings in the Capacitated House Allocation Problem
• Popular Matchings: Structure and Algorithms
• Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
• Rank-maximal matchings
• The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
• Weighted Popular Matchings

Cited in

(13)

• Strategy-proof popular mechanisms
• Popular matchings with two-sided preferences and one-sided ties
• Unpopularity factor in the marriage and roommates problems
• Random popular matchings with incomplete preference lists
• Popular Matchings in the Capacitated House Allocation Problem
• On weakly and strongly popular rankings
• Popular matchings with weighted voters
• Minimal envy and popular matchings
• The popular matching and condensation problems under matroid constraints
• Weighted popular matchings
• Popular matchings with ties and matroid constraints
• Popular and clan-popular \(b\)-matchings
• Popular matchings with two-sided preference lists and matroid constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972348)