The following pages link to Hard variants of stable marriage. (Q1605313):
Displaying 37 items.
- The exchange-stable marriage problem (Q2576343) (← links)
- Testing substitutability of weak preferences (Q2637415) (← links)
- Mixed-integer formulations for the capacitated rank pricing problem with envy (Q2669780) (← links)
- Marriage market with indifferences: a linear programming approach (Q2687690) (← links)
- Finding all stable pairs and solutions to the many-to-many stable matching problem (Q2815443) (← links)
- The Stable Roommates Problem with Short Lists (Q2819460) (← links)
- Locally Stable Marriage with Strict Preferences (Q2968513) (← links)
- Improved Approximation Bounds for the Student-Project Allocation Problem with Preferences over Projects (Q3010424) (← links)
- Marriages Made in the Heavens: A Practical Application of Existence (Q3153927) (← links)
- COALITION FORMATION GAMES: A SURVEY (Q3444827) (← links)
- Better and Simpler Approximation Algorithms for the Stable Marriage Problem (Q3541122) (← links)
- Size Versus Stability in the Marriage Problem (Q3602826) (← links)
- Solving stable matching problems using answer set programming (Q4593026) (← links)
- An efficient implementation of the Gale and Shapley “propose-and-reject” algorithm (Q4957968) (← links)
- How hard is it to satisfy (almost) all roommates (Q5002706) (← links)
- On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization) (Q5062116) (← links)
- (Q5091034) (← links)
- A 3 / 2 -approximation Algorithm for the Student-Project Allocation Problem (Q5140716) (← links)
- Bribery and Control in Stable Marriage (Q5154751) (← links)
- Balanced stable marriage: how close is close enough? (Q5918373) (← links)
- Maximum stable matching with one-sided ties of bounded length (Q5918705) (← links)
- Super-stability in the student-project allocation problem with ties (Q5918742) (← links)
- Finding strongly popular \(b\)-matchings in bipartite graphs (Q5918874) (← links)
- Envy-freeness and relaxed stability: hardness and approximation algorithms (Q5925588) (← links)
- On the complexity of exchange-stable roommates (Q5957362) (← links)
- Review of the theory of stable matchings and contract systems (Q6039790) (← links)
- Distance on matchings: An axiomatic approach (Q6076902) (← links)
- Stable matching with multilayer approval preferences: approvals can be harder than strict preferences (Q6109539) (← links)
- Incomplete list setting of the hospitals/residents problem with maximally satisfying lower quotas (Q6109545) (← links)
- Cutoff stability under distributional constraints with an application to summer internship matching (Q6120933) (← links)
- A simple matching domain with indifferences and a master list (Q6156344) (← links)
- Algorithms for new types of fair stable matchings (Q6487609) (← links)
- Stable matchings, one-sided ties, and approximate popularity (Q6547210) (← links)
- Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains (Q6565042) (← links)
- Adapting stable matchings to forced and forbidden pairs (Q6627043) (← links)
- Manipulating the outcome of stable marriage and roommates problems (Q6634129) (← links)
- Effective data reduction for strongly stable matching in very sparse graphs (Q6663523) (← links)
