The Stable Roommates Problem with Ties
From MaRDI portal
Recommendations
- The strongly stable roommates problem
- The roommates problem revisited
- Stable roommates problem with random preferences
- The stable roommates problem with short lists
- The Stable Roommates Problem with Short Lists
- scientific article; zbMATH DE number 1369412
- The Stable Roommates Problem with Choice Functions
- The stable roommates problem with choice functions
- On a generalization of the stable roommates problem
- The stable fixtures problem -- a many-to-many extension of stable roommates
Cited in
(47)- Computational complexity of stable partitions with b-preferences
- On a cutting plane heuristic for the stable roommates problem and its applications
- The stable roommates problem with short lists
- Stable marriage and roommates problems with restricted edges: complexity and approximability
- Stable partitions with \(\mathcal W\)-preferences
- The stable crews problem
- Strongly stable and maximum weakly stable noncrossing matchings
- Stable roommate with narcissistic, single-peaked, and single-crossing preferences
- The stable marriage problem: an interdisciplinary review from the physicist's perspective
- Borda-induced hedonic games with friends, enemies, and neutral players
- An approach to robustness in the stable roommates problem and its comparison with the stable marriage problem
- The stable fixtures problem -- a many-to-many extension of stable roommates
- Two hardness results for core stability in hedonic coalition formation games
- On the stable \(b\)-matching problem in multigraphs
- A genetic algorithm for the project assignment problem
- scientific article; zbMATH DE number 1617265 (Why is no real title available?)
- The Stable Roommates Problem with Short Lists
- Stable marriage and roommates problems with restricted edges: complexity and approximability
- NP-complete stable matching problems
- Two’s Company, Three’s a Crowd: Stable Family and Threesome Roommates Problems
- Size Versus Stability in the Marriage Problem
- Stable assignment with couples: parameterized complexity and local search
- The strongly stable roommates problem
- When do stable roommate matchings exist? A review
- Strongly stable and maximum weakly stable noncrossing matchings
- A matroid generalization of the super-stable matching problem
- Pairwise Preferences in the Stable Marriage Problem
- A General Framework for Stable Roommates Problems using Answer Set Programming
- Many-to-many stable matchings with ties in trees
- Hardness results for stable exchange problems
- Approximation and Online Algorithms
- Hardness results for stable exchange problems
- Review of the theory of stable matchings and contract systems
- Balancing stability and efficiency in team formation as a generalized roommate problem
- Stable matching with multilayer approval preferences: approvals can be harder than strict preferences
- Win-win match using a genetic algorithm
- Stable matching with multilayer approval preferences: approvals can be harder than strict preferences
- An algorithm for a super-stable roommates problem
- Effective data reduction for strongly stable matching in very sparse graphs
- Exact and approximate heuristics for the multi-modal stable matching with applications in industry chains
- Stable roommates spanner
- Modifying an instance of the super-stable matching problem
- Structural and algorithmic results for stable cycles and partitions in the roommates problem
- The stable marriage problem with ties and restricted edges
- Size versus stability in the marriage problem
- Geometric stable roommates
- Efficient algorithms for generalized stable marriage and roommates problems
This page was built for publication: The Stable Roommates Problem with Ties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3150272)
