The following pages link to (Q2721985):
Displayed 33 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)
- Equivalence of two-sided stable matching (Q1631687) (← links)
- Three-sided stable matching problem with two of them as cooperative partners (Q1740415) (← links)
- Three-dimensional stable matching with hybrid preferences (Q1740420) (← links)
- Randomized approximation of the stable marriage problem (Q1884845) (← links)
- Strongly stable and maximum weakly stable noncrossing matchings (Q1979449) (← links)
- Improving solution times for stable matching problems through preprocessing (Q2027037) (← links)
- Stable matchings in the marriage model with indifferences (Q2059169) (← links)
- Coalitional permutation manipulations in the Gale-Shapley algorithm (Q2060701) (← links)
- The stable marriage problem: an interdisciplinary review from the physicist's perspective (Q2231919) (← links)
- Stable matching with uncertain linear preferences (Q2309477) (← links)
- Two problems in max-size popular matchings (Q2415362) (← links)
- Deferred acceptance algorithms: history, theory, practice, and open questions (Q2482681) (← links)
- Lazy Gale-Shapley for many-to-one matching with partial information (Q2695460) (← links)
- Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints (Q3449577) (← links)
- An efficient implementation of the Gale and Shapley “propose-and-reject” algorithm (Q4957968) (← links)
- Strongly Stable and Maximum Weakly Stable Noncrossing Matchings (Q5041200) (← links)
- A Matroid Generalization of the Super-Stable Matching Problem (Q5084102) (← links)
- Pairwise Preferences in the Stable Marriage Problem (Q5090469) (← links)
- (Q5136309) (← links)
- Pareto Stable Matchings under One-Sided Matroid Constraints (Q5232161) (← links)
- Super-stability in the student-project allocation problem with ties (Q5918742) (← links)
- Review of the theory of stable matchings and contract systems (Q6039790) (← links)
- Distance on matchings: An axiomatic approach (Q6076902) (← links)