Computing Stable Outcomes in Hedonic Games

  title={Computing Stable Outcomes in Hedonic Games},
  author={Martin Gairing and Rahul Savani},
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected edge-weighted graph: nodes are players, an outcome of the game is a partition of the nodes into coalitions, and the utility of a node is the sum of incident edge weights in the same coalition. We consider several natural stability requirements defined in the economics literature. For all of them the existence of a stable… CONTINUE READING
Highly Cited
This paper has 54 citations. REVIEW CITATIONS

1 Figure or Table



Citations per Year

55 Citations

Semantic Scholar estimates that this publication has 55 citations based on the available data.

See our FAQ for additional information.