Nash stability in additively separable hedonic games and community structures
type: Item
instance of: scholarly article
title: Nash stability in additively separable hedonic games and community structures
zbMATH Open document ID: 1187.91018
author: Martin Olsen
published in: Theory of Computing Systems
publication date: 2009-10-19T00:00:00Z
Mathematics Subject Classification ID: 91A12
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5617719
zbMATH Keywords: additively separable hedonic games
zbMATH Keywords: NP-completeness
zbMATH Keywords: Nash stability
zbMATH Keywords: community structures
MaRDI profile type: Publication
full work available at URL: s00224-009-9176-8
OpenAlex ID: W2041293803
cites work: NP-completeness in hedonic games
cites work: Coalition formation games with separable preferences.
cites work: Computational complexity of stable partitions with b-preferences
cites work: Stable partitions with \(\mathcal W\)-preferences
cites work: Walrasian equilibrium: Hardness, approximations and tractable instances
cites work: Algorithms – ESA 2005
cites work: Graph Clustering and Minimum Cut Trees
cites work: Q4198056
cites work: The stability of hedonic coalition structures
cites work: Community structure in social and biological networks
cites work: On core membership testing for hedonic coalition formation games
DOI: 10.1007/S00224-009-9176-8
description: scientific article; zbMATH DE number 5617719