Popular Matchings in the Capacitated House Allocation Problem
From MaRDI portal
Publication:5449553
DOI10.1007/11841036_45zbMath1131.05320OpenAlexW1564148014MaRDI QIDQ5449553
David F. Manlove, Colin T. S. Sng
Publication date: 11 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://eprints.gla.ac.uk/3503/1/ESA06.pdf
Related Items (20)
Popular Matchings with Two-Sided Preferences and One-Sided Ties ⋮ The popular matching and condensation problems under matroid constraints ⋮ Popular Matchings: Structure and Algorithms ⋮ The Generalized Popular Condensation Problem ⋮ Popular Matchings with Ties and Matroid Constraints ⋮ Bounded Unpopularity Matchings ⋮ Popular matchings with variable item copies ⋮ Donation center location problem ⋮ Bounded unpopularity matchings ⋮ Popular matchings: structure and algorithms ⋮ Popular Matchings in the Stable Marriage Problem ⋮ Matching with indifferences: a comparison of algorithms in the context of course allocation ⋮ Popular and clan-popular \(b\)-matchings ⋮ Popular mixed matchings ⋮ Popular matchings in the weighted capacitated house allocation problem ⋮ Popularity at minimum cost ⋮ Popular matchings with two-sided preference lists and matroid constraints ⋮ Weighted popular matchings ⋮ Strategy-proof popular mechanisms ⋮ Unnamed Item
This page was built for publication: Popular Matchings in the Capacitated House Allocation Problem
