The following pages link to Rank-maximal matchings (Q2944532):
Displaying 28 items.
- Fair matchings and related problems (Q270032) (← links)
- Popular matchings with variable item copies (Q631788) (← links)
- Popular matchings: structure and algorithms (Q652638) (← links)
- Optimal popular matchings (Q967372) (← links)
- Popular matchings in the weighted capacitated house allocation problem (Q972348) (← links)
- Rank-maximal matchings -- structure and algorithms (Q1733053) (← links)
- Maximum locally stable matchings (Q1736563) (← links)
- Popularity at minimum cost (Q2015798) (← links)
- Approximation by lexicographically maximal solutions in matching and matroid intersection problems (Q2118859) (← links)
- The envy-free matching problem with pairwise preferences (Q2234784) (← links)
- Popular and clan-popular \(b\)-matchings (Q2250455) (← links)
- Exact and approximation algorithms for weighted matroid intersection (Q2316615) (← links)
- Dynamic rank-maximal and popular matchings (Q2420654) (← links)
- Profile-Based Optimal Matchings in the Student/Project Allocation Problem (Q2946056) (← links)
- Bounded Unpopularity Matchings (Q3512453) (← links)
- Graded Matching for Large Observational Studies (Q5057279) (← links)
- Pareto Stable Matchings under One-Sided Matroid Constraints (Q5232161) (← links)
- Random Popular Matchings with Incomplete Preference Lists (Q5240370) (← links)
- A New Approach to the Pareto Stable Matching Problem (Q5244872) (← links)
- Popular Matchings: Structure and Algorithms (Q5323098) (← links)
- Popular Matchings with Ties and Matroid Constraints (Q5351863) (← links)
- Weighted popular matchings (Q5501956) (← links)
- Favoring Eagerness for Remaining Items: Designing Efficient, Fair, and Strategyproof Mechanisms (Q5881800) (← links)
- Matching with sizes (or scheduling with processing set restrictions) (Q5892177) (← links)
- Stable and extremely unequal (Q6047334) (← links)
- The dynamics of rank-maximal and popular matchings (Q6093577) (← links)
- Computing welfare-maximizing fair allocations of indivisible goods (Q6109821) (← links)
- Envy-free matchings in bipartite graphs and their applications to fair division (Q6154777) (← links)
