The following pages link to (Q2721985):
Displayed 13 items.
- The hospitals/residents problem with lower quotas (Q261379) (← links)
- The Pareto-stability concept is a natural solution concept for discrete matching markets with indifferences (Q637586) (← links)
- On the complexity of distributed stable matching with small messages (Q660987) (← links)
- Two algorithms for the student-project allocation problem (Q924544) (← links)
- A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem (Q930600) (← links)
- The stable marriage problem with master preference lists (Q1005239) (← links)
- Stable marriage with ties and bounded length preference lists (Q1026229) (← links)
- Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems (Q1029707) (← links)
- Approximability results for stable marriage problems with ties. (Q1426466) (← links)
- Hard variants of stable marriage. (Q1605313) (← links)
- Randomized approximation of the stable marriage problem (Q1884845) (← links)
- Deferred acceptance algorithms: history, theory, practice, and open questions (Q2482681) (← links)
- Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints (Q3449577) (← links)