Popular Matchings: Structure and Algorithms

DOI10.1007/978-3-642-02882-3_50zbMath1248.05158OpenAlexW1908913551MaRDI QIDQ5323098

Robert W. Irving, Eric J. McDermid

Publication date: 23 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

algorithmsenumerationcountingdirected graphswitching graphpreference listpostsapplicantsPOP-Mpopulat matching problem

Mathematics Subject Classification ID

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

Related Items (8)

Popular Matchings with Two-Sided Preferences and One-Sided Ties ⋮ Bounded unpopularity matchings ⋮ Popular and clan-popular \(b\)-matchings ⋮ Optimal popular matchings ⋮ Popular matchings in the weighted capacitated house allocation problem ⋮ Finding strongly popular \(b\)-matchings in bipartite graphs ⋮ Strategy-proof popular mechanisms ⋮ Unnamed Item

Cites Work

• Popular matchings: structure and algorithms
• Optimal popular matchings
• 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