Popular matchings
From MaRDI portal
Publication:2921697
zbMATH Open1297.68087MaRDI QIDQ2921697FDOQ2921697
Authors: David J. Abraham, Robert W. Irving, Telikepalli Kavitha, K. Mehlhorn 
Publication date: 13 October 2014
Recommendations
Cited In (44)
- An optimal algorithm for the popular condensation problem
- Minimal envy and popular matchings
- A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem
- Popular matchings with two-sided preferences and one-sided ties
- Maintaining Near-Popular Matchings
- Popular mixed matchings
- Popularity vs maximum cardinality in the stable marriage setting
- Voting paths
- Popular branchings and their dual certificates
- Counting popular matchings in house allocation problems
- Weighted random popular matchings
- Popular Mixed Matchings
- Popular matchings of desired size
- Popular and clan-popular \(b\)-matchings
- Popular matchings with multiple partners
- Popular Matchings
- Random popular matchings with incomplete preference lists
- A social choice approach to ordinal group activity selection
- How Good Are Popular Matchings
- Random popular matchings with incomplete preference lists
- Popular matchings in the stable marriage problem
- It is difficult to tell if there is a Condorcet spanning tree
- Unpopularity factor in the marriage and roommates problems
- Popular matchings with ties and matroid constraints
- Reducing rank-maximal to maximum weight matching
- Popular matchings with two-sided preferences and one-sided ties
- Popular branchings and their dual certificates
- Popular Matchings in the Capacitated House Allocation Problem
- Popular and Clan-Popular b-Matchings
- Weighted popular matchings
- Popular matchings with two-sided preference lists and matroid constraints
- Bounded unpopularity matchings
- Popular matchings with weighted voters
- Popular matchings with variable item copies
- Popular matchings: structure and algorithms
- Bounded Unpopularity Matchings
- Weighted Popular Matchings
- Dynamic Matching Markets and Voting Paths
- Popular matchings in the marriage and roommates problems
- Optimal popular matchings
- Popular matchings with variable job capacities
- Dynamic rank-maximal and popular matchings
- Popular ranking
- Preference-constrained oriented matching
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)
