Proceedings

Welfare Maximization in Fractional Hedonic Games

Download BibTeX Cite

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence. Main Track. Pages 461-466.

Abstract

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.

Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Julián Mestre, and Hanjo Täubig. 2015. Welfare Maximization in Fractional Hedonic Games. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-15. IJCAI, 461–466. https://ijcai.org/proceedings/2015/71
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards