Sciweavers

130
Voted
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
15 years 2 days ago
Computing Stable Outcomes in Hedonic Games
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
Martin Gairing, Rahul Savani