The following pages link to Popular matchings (Q2921697):
Displaying 26 items.
- It is difficult to tell if there is a Condorcet spanning tree (Q328521) (← links)
- Popular mixed matchings (Q541674) (← links)
- Popular matchings with variable item copies (Q631788) (← links)
- Bounded unpopularity matchings (Q644804) (← links)
- Popular matchings: structure and algorithms (Q652638) (← links)
- A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem (Q930600) (← links)
- Optimal popular matchings (Q967372) (← links)
- Popular matchings of desired size (Q1627184) (← links)
- A social choice approach to ordinal group activity selection (Q1642162) (← links)
- Popular edges and dominant matchings (Q1800997) (← links)
- Popular matchings in the stable marriage problem (Q1951580) (← links)
- Popularity at minimum cost (Q2015798) (← links)
- Unpopularity factor in the marriage and roommates problems (Q2043880) (← links)
- Popular branchings and their dual certificates (Q2118146) (← links)
- Minimal envy and popular matchings (Q2242327) (← links)
- Popular and clan-popular \(b\)-matchings (Q2250455) (← links)
- Popular matchings with two-sided preference lists and matroid constraints (Q2290635) (← links)
- Dynamic rank-maximal and popular matchings (Q2420654) (← links)
- Popular ranking (Q2448918) (← links)
- Reducing rank-maximal to maximum weight matching (Q2465632) (← links)
- Weighted random popular matchings (Q3061183) (← links)
- Maintaining Near-Popular Matchings (Q3449500) (← links)
- Popular Matchings with Variable Job Capacities (Q3652230) (← links)
- Popular and Clan-Popular b-Matchings (Q4909528) (← links)
- How Good Are Popular Matchings (Q5140718) (← links)
- Random Popular Matchings with Incomplete Preference Lists (Q5240370) (← links)
