Weighted popular matchings

DOI10.1145/2556951zbMath1321.68370arXiv0707.0546OpenAlexW1546314173MaRDI QIDQ5501956

Julián Mestre

Publication date: 14 August 2015

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0707.0546

zbMATH Keywords

bipartite matchingpopular matching

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05)

Related Items (8)

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 with Ties and Matroid Constraints ⋮ Finding popular branchings in vertex-weighted directed graphs ⋮ Minimal envy and popular matchings ⋮ Popular matchings with two-sided preference lists and matroid constraints ⋮ Strategy-proof popular mechanisms

Cites Work

• Unnamed Item
• Popular matchings in the weighted capacitated house allocation problem
• Residence exchange wanted: A stable residence exchange problem
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On a conjecture by Gale about one-sided matching problems
• Rank-maximal matchings
• Weighted random popular matchings
• Popular Matchings
• Weighted Popular Matchings
• Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
• Popular Matchings in the Capacitated House Allocation Problem
• Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Algorithms and Computation
• Dynamic Matching Markets and Voting Paths

This page was built for publication: Weighted popular matchings