{"type":"ScholarlyArticle","title":"Welfare Maximization in Fractional Hedonic Games","authors":[{"name":"Haris Aziz","slug":"haris-aziz","given":"Haris","family":"Aziz","affiliation":""},{"name":"Serge Gaspers","slug":"serge-gaspers","given":"Serge","family":"Gaspers","affiliation":""},{"name":"Joachim Gudmundsson","slug":"joachim-gudmundsson","given":"Joachim","family":"Gudmundsson","affiliation":""},{"name":"Julián Mestre","slug":"julian-mestre","given":"Julián","family":"Mestre","affiliation":""},{"name":"Hanjo Täubig","slug":"hanjo-taubig","given":"Hanjo","family":"Täubig","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2015/71","pdf":"https://ijcai.org/proceedings/2015/0071.pdf","markdown":"https://ijcai.org/proceedings/2015/71.md","bibtex":"https://ijcai.org/proceedings/2015/bibtex/71","volume":{"slug":"2015","title":"Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2015","url":"https://ijcai.org/proceedings/2015/","year":2015,"location":"Buenos Aires, Argentina","dates":"25–31 July 2015","editors":"Qiang Yang and Michael Wooldridge","isbn":"978-1-57735-738-4","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Game Theory","track":"Main Track","number":71,"pages":{"first":461,"last":466},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}