3 search results - page 1 / 1 » Nash Stability in Additively Separable Hedonic Games Is NP-H... |
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...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. We present computational results concerning stable partitions in additively separable hedonic games. First, we propose a polynomial-time algorithm to compute a contractua...
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...