Stable partitions with W-preferences
From MaRDI portal
Recommendations
Cites work
- An efficient algorithm for the “stable roommates” problem
- Computational complexity of stable partitions with b-preferences
- scientific article; zbMATH DE number 45086 (Why is no real title available?)
- scientific article; zbMATH DE number 1538853 (Why is no real title available?)
- NP-complete stable matching problems
- Stability in coalition formation games
- Stable marriage and indifference
- The Stable Roommates Problem with Ties
Cited in
(14)- Computational complexity in additive hedonic games
- Stability in coalition formation games
- Computational complexity of stable partitions with b-preferences
- Stable partitions in a model with group-dependent feasible sets
- Borda-induced hedonic games with friends, enemies, and neutral players
- On myopic stability concepts for hedonic games
- Pareto optimality in coalition formation
- Two hardness results for core stability in hedonic coalition formation games
- On core membership testing for hedonic coalition formation games
- COALITION FORMATION GAMES: A SURVEY
- scientific article; zbMATH DE number 1538853 (Why is no real title available?)
- Altruistic Hedonic Games
- Nash stability in additively separable hedonic games and community structures
- On stable embeddability of partitions
This page was built for publication: Stable partitions with \(\mathcal W\)-preferences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827807)