Popular matchings
From MaRDI portal
Recommendations
Cited in
(45)- Popular matchings of desired size
- Random popular matchings with incomplete preference lists
- A social choice approach to ordinal group activity selection
- Popular matchings in the stable marriage problem
- Unpopularity factor in the marriage and roommates problems
- Popular branchings and their dual certificates
- Minimal envy and popular matchings
- Popular and clan-popular b-matchings
- Popular matchings with two-sided preference lists and matroid constraints
- Many-to-one popular matchings with two-sided preferences and one-sided ties
- Dynamic rank-maximal and popular matchings
- Popular ranking
- Reducing rank-maximal to maximum weight matching
- An optimal algorithm for the popular condensation problem
- Weighted random popular matchings
- It is difficult to tell if there is a Condorcet spanning tree
- Popular matchings with two-sided preferences and one-sided ties
- Maintaining Near-Popular Matchings
- Bounded Unpopularity Matchings
- Popular Matchings
- Popular matchings in the marriage and roommates problems
- Weighted Popular Matchings
- Popular Mixed Matchings
- Popular matchings with variable job capacities
- Popular and Clan-Popular b-Matchings
- Counting popular matchings in house allocation problems
- Popular branchings and their dual certificates
- Popular matchings with multiple partners
- How Good Are Popular Matchings
- Preference-constrained oriented matching
- Random popular matchings with incomplete preference lists
- Popular matchings with ties and matroid constraints
- Popular matchings with two-sided preferences and one-sided ties
- Voting paths
- Popular mixed matchings
- Popular Matchings in the Capacitated House Allocation Problem
- Weighted popular matchings
- Popularity vs maximum cardinality in the stable marriage setting
- Dynamic Matching Markets and Voting Paths
- Popular matchings with variable item copies
- Bounded unpopularity matchings
- Popular matchings with weighted voters
- Popular matchings: structure and algorithms
- A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem
- Optimal popular matchings
This page was built for publication: Popular matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921697)
