资源分类
》 资源 》》Welfare Maximization in Fractional Hedonic Games Haris Aziz and Serge Gaspers Joachim Gudmundsson and Julia?n Mestre

Welfare Maximization in Fractional Hedonic Games Haris Aziz and Serge Gaspers Joachim Gudmundsson and Julia?n Mestre

2019-11-18 | |  34 |   1 |   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? Elliot Anshelevich and Onkar Bhardwaj and Koushik Kar

下一篇：Approximate Nash Equilibria with Near Optimal Social Welfare ?

用户评价
全部评价

热门资源

  • Multi-Source Cros...

    Modern NLP applications have enjoyed a great bo...

  • Reference Network...

    Neural Machine Translation (NMT) has achieved n...

  • Soft Contextual D...

    While data augmentation is an important trick t...

  • Style Transformer...

    Disentangling the content and style in the lat...

  • Towards Fine-grai...

    In this paper, we focus on the task of finegra...