Size Versus Stability in the Marriage Problem
From MaRDI portal
Recommendations
Cites work
- An efficient algorithm for the “stable roommates” problem
- Approximation and Online Algorithms
- College Admissions and the Stability of Marriage
- Hard variants of stable marriage.
- scientific article; zbMATH DE number 45086 (Why is no real title available?)
- scientific article; zbMATH DE number 1305096 (Why is no real title available?)
- scientific article; zbMATH DE number 1369412 (Why is no real title available?)
- Instability of matchings in decentralized markets with various preference structures
- Kidney Exchange
- NP-complete stable matching problems
- On-line algorithms for weighted bipartite matching and stable marriages
- Pairwise kidney exchange
- Size versus stability in the marriage problem
- Some remarks on the stable matching problem
- The Complexity of Counting Stable Marriages
- The Stable Roommates Problem with Ties
- Two algorithms for the student-project allocation problem
Cited in
(14)- Stable marriage with ties and bounded length preference lists
- On the complexity of robust stable marriage
- Local search approaches in stable matching problems
- Almost stable matchings by truncating the Gale-Shapley algorithm
- Stable marriage with groups of similar agents
- Solving hard stable matching problems involving groups of similar agents
- Stable matchings in trees
- Complexity study for the robust stable marriage problem
- Preference swaps for the stable matching problem
- Sex-equal stable matchings: complexity and exact algorithms
- A Size-Popularity Tradeoff in the Stable Marriage Problem
- Misrepresentation and stability in the marriage problem
- Size versus stability in the marriage problem
- An improved approximation lower bound for finding almost stable maximum matchings
This page was built for publication: Size Versus Stability in the Marriage Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602826)
