Rank-maximal matchings
From MaRDI portal
Publication:2944532
DOI10.1145/1198513.1198520zbMath1321.90116OpenAlexW2045342277MaRDI QIDQ2944532
Katarzyna E. Paluch, Kurt Mehlhorn, Robert W. Irving, Dimitrios Michail, Telikepalli Kavitha
Publication date: 2 September 2015
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1198513.1198520
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Favoring Eagerness for Remaining Items: Designing Efficient, Fair, and Strategyproof Mechanisms ⋮ Fair matchings and related problems ⋮ Graded Matching for Large Observational Studies ⋮ Popular Matchings: Structure and Algorithms ⋮ Profile-Based Optimal Matchings in the Student/Project Allocation Problem ⋮ Stable and extremely unequal ⋮ Dynamic rank-maximal and popular matchings ⋮ Popular Matchings with Ties and Matroid Constraints ⋮ The dynamics of rank-maximal and popular matchings ⋮ Computing welfare-maximizing fair allocations of indivisible goods ⋮ Envy-free matchings in bipartite graphs and their applications to fair division ⋮ Bounded Unpopularity Matchings ⋮ Popular matchings with variable item copies ⋮ Popular matchings: structure and algorithms ⋮ Matching with sizes (or scheduling with processing set restrictions) ⋮ Rank-maximal matchings -- structure and algorithms ⋮ Maximum locally stable matchings ⋮ The envy-free matching problem with pairwise preferences ⋮ Popular and clan-popular \(b\)-matchings ⋮ Optimal popular matchings ⋮ Popular matchings in the weighted capacitated house allocation problem ⋮ Popularity at minimum cost ⋮ Pareto Stable Matchings under One-Sided Matroid Constraints ⋮ Exact and approximation algorithms for weighted matroid intersection ⋮ Random Popular Matchings with Incomplete Preference Lists ⋮ A New Approach to the Pareto Stable Matching Problem ⋮ Weighted popular matchings ⋮ Approximation by lexicographically maximal solutions in matching and matroid intersection problems
This page was built for publication: Rank-maximal matchings
