Nash stability in additively separable hedonic games and community structures
From MaRDI portal
(Redirected from Publication:733746)
Recommendations
- Nash Stability in Additively Separable Hedonic Games Is NP-Hard
- Computational complexity in additive hedonic games
- On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities
- Computing Stable Outcomes in Hedonic Games
- Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Algorithms – ESA 2005
- Coalition formation games with separable preferences.
- Community structure in social and biological networks
- Computational complexity of stable partitions with b-preferences
- Graph Clustering and Minimum Cut Trees
- NP-completeness in hedonic games
- On core membership testing for hedonic coalition formation games
- Stable partitions with \(\mathcal W\)-preferences
- The stability of hedonic coalition structures
- Walrasian equilibrium: Hardness, approximations and tractable instances
Cited in
(10)- On Pareto optimality in social distance games
- On the price of stability of some simple graph-based hedonic games
- Maximizing utilitarian and egalitarian welfare of fractional hedonic games on tree-like graphs
- On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities
- A general view on computing communities
- Stability and welfare in (dichotomous) hedonic diversity games
- The price of stability of simple symmetric fractional hedonic games
- Nash Stability in Additively Separable Hedonic Games Is NP-Hard
- Additively separable hedonic games with social context
- Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games
This page was built for publication: Nash stability in additively separable hedonic games and community structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733746)
