Recommendations
- scientific article; zbMATH DE number 6469133
- Capacitated Rank-Maximal Matchings
- Maximal rank in matrix spaces via graph matchings
- Dynamic rank-maximal matchings
- Matchability and \(k\)-maximal matchings
- scientific article; zbMATH DE number 4114698
- Classified rank-maximal matchings and popular matchings -- algorithms and hardness
- Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems
Cited in
(41)- Maximum locally stable matchings
- Approximation by lexicographically maximal solutions in matching and matroid intersection problems
- The envy-free matching problem with pairwise preferences
- Popular and clan-popular b-matchings
- Exact and approximation algorithms for weighted matroid intersection
- Dynamic rank-maximal matchings
- Dynamic rank-maximal and popular matchings
- Reducing rank-maximal to maximum weight matching
- Fair matchings and related problems
- Profile-based optimal matchings in the student/project allocation problem
- Bounded Unpopularity Matchings
- scientific article; zbMATH DE number 4114698 (Why is no real title available?)
- Capacitated Rank-Maximal Matchings
- Graded Matching for Large Observational Studies
- Max-min greedy matching
- Pareto stable matchings under one-sided matroid constraints
- Random popular matchings with incomplete preference lists
- A new approach to the Pareto stable matching problem
- Popular Matchings: Structure and Algorithms
- Popular matchings with ties and matroid constraints
- Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems
- scientific article; zbMATH DE number 6469133 (Why is no real title available?)
- Weighted popular matchings
- scientific article; zbMATH DE number 4185816 (Why is no real title available?)
- Favoring Eagerness for Remaining Items: Designing Efficient, Fair, and Strategyproof Mechanisms
- Matching with sizes (or scheduling with processing set restrictions)
- Stable and extremely unequal
- 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
- Popular matchings with variable item copies
- Popular matchings: structure and algorithms
- On stable marriages and greedy matchings
- Improved truthful rank approximation for rank-maximal matchings
- Truthful approximation for rank-maximal matchings
- Abundant neighborhoods, two-sided markets, and maximal matchings
- Deterministic and universal truthful mechanism for fair matching
- Von Neumann-Morgenstern stability and internal closedness in matching theory
- Von Neumann-Morgenstern stability and internal closedness in matching theory
- Optimal popular matchings
- Popular matchings in the weighted capacitated house allocation problem
This page was built for publication: Rank-maximal matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944532)
