Popular matchings: structure and algorithms

DOI10.1007/S10878-009-9287-9zbMath1230.91146OpenAlexW1979125736MaRDI QIDQ652638

Robert W. Irving, Eric J. McDermid

Publication date: 15 December 2011

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: http://eprints.gla.ac.uk/6701/1/6701.pdf

zbMATH Keywords

bipartite graphsmatchingsone-sided preference lists

Mathematics Subject Classification ID

Games involving graphs (91A43) Matching models (91B68)

Related Items (10)

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 ⋮ Rank-maximal matchings -- structure and algorithms ⋮ POPULAR SPANNING TREES ⋮ Minimal envy and popular matchings ⋮ Popularity at minimum cost ⋮ Popular edges and dominant matchings

Cites Work

• Rank-maximal matchings
• Bounded Unpopularity Matchings
• Popular Matchings
• Weighted Popular Matchings
• Popular Matchings in the Capacitated House Allocation Problem
• The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
• Dynamic Matching Markets and Voting Paths

This page was built for publication: Popular matchings: structure and algorithms