Sciweavers

SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
13 years 10 months 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