Optimal popular matchings

DOI10.1016/j.dam.2009.06.004zbMath1213.05212OpenAlexW2063897561WikidataQ62045786 ScholiaQ62045786MaRDI QIDQ967372

Meghana Nasre, Telikepalli Kavitha

Publication date: 28 April 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.06.004

zbMATH Keywords

design of algorithmsbipartite graphsmatchingspopular matchingone-sided preference lists

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (18)

Popular Matchings with Two-Sided Preferences and One-Sided Ties ⋮ Popular Matchings with Two-Sided Preferences and One-Sided Ties ⋮ Finding popular branchings in vertex-weighted digraphs ⋮ The popular matching and condensation problems under matroid constraints ⋮ Popular Matchings: Structure and Algorithms ⋮ The Generalized Popular Condensation Problem ⋮ Finding and Recognizing Popular Coalition Structures ⋮ Popular Matchings with Ties and Matroid Constraints ⋮ Finding popular branchings in vertex-weighted directed graphs ⋮ Bounded unpopularity matchings ⋮ Rank-maximal matchings -- structure and algorithms ⋮ POPULAR SPANNING TREES ⋮ Minimal envy and popular matchings ⋮ Popular and clan-popular \(b\)-matchings ⋮ Popular matchings in the weighted capacitated house allocation problem ⋮ Popularity at minimum cost ⋮ Finding strongly popular \(b\)-matchings in bipartite graphs ⋮ Unnamed Item

Cites Work

• Rank-maximal matchings
• Popular Matchings
• Popular Matchings: Structure and Algorithms
• Unnamed Item

This page was built for publication: Optimal popular matchings