Authors
Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Hanjo Taubig
Publication date
2015/6/22
Conference
Twenty-Fourth International Joint Conference on Artificial Intelligence
Description
We consider the computational complexity of computing welfare maximizing partitions for fractional hedonic games—a natural class of coalition formation games that can be succinctly represented by a graph. For such games, welfare maximizing partitions constitute desirable ways to cluster the vertices of the graph. We present both intractability results and approximation algorithms for computing welfare maximizing partitions.
Scholar articles
H Aziz, S Gaspers, J Gudmundsson, J Mestre… - Twenty-Fourth International Joint Conference on …, 2015
H Aziz, S Gaspers, J Gudmundsson, J Mestre - Proceedings of the 24th International Joint Conference …