资源分类
》 资源 》论文》Welfare Maximization in Fractional Hedonic Games

Welfare Maximization in Fractional Hedonic Games

2019-11-18 | |  57 |   38 |   0

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.

上一篇：Strategic Network Formation through an Intermediary

下一篇：Possible and Necessary Allocations via Sequential Mechanisms

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...