ML Anthology

Welfare Maximization in Fractional Hedonic Games

Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Hanjo Täubig
IJCAI 2015 pp. 461-467
/ijcai/2015/aziz2015ijcai-welfare/

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.

PDF IJCAI Semantic Scholar

Cite

Text

Aziz et al. "Welfare Maximization in Fractional Hedonic Games." International Joint Conference on Artificial Intelligence, 2015.

Markdown

[Aziz et al. "Welfare Maximization in Fractional Hedonic Games." International Joint Conference on Artificial Intelligence, 2015.](https://mlanthology.org/ijcai/2015/aziz2015ijcai-welfare/)

BibTeX

@inproceedings{aziz2015ijcai-welfare,
  title     = {{Welfare Maximization in Fractional Hedonic Games}},
  author    = {Aziz, Haris and Gaspers, Serge and Gudmundsson, Joachim and Mestre, Julián and Täubig, Hanjo},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2015},
  pages     = {461-467},
  url       = {https://mlanthology.org/ijcai/2015/aziz2015ijcai-welfare/}
}