103 search results - page 1 / 21 » Hedonic clustering games |
SPAA
2012
ACM
11 years 7 months ago
2012
ACM
ATAL
2009
Springer
13 years 11 months ago
2009
Springer
In hedonic games, players have the opportunity to form coalitions, and have preferences over the coalitions they might join. Such games can be used to model a variety of settings ...
CIE
2007
Springer
13 years 11 months ago
2007
Springer
Ballester has shown that the problem of deciding whether a Nash stable partition exists in a hedonic game with arbitrary preferences is NP-complete. In this paper we will prove tha...
SAGT
2010
Springer
13 years 3 months ago
2010
Springer
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...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We conduct a computational analysis of partitions in additively separable hedonic games that satisfy standard criteria of fairness and optimality. We show that computing a partiti...