Fractional Hedonic Games

Fractional Hedonic Games
复制标题

分数享乐游戏

DOI:
10.1145/3327970
复制
发表时间:
2019
期刊:
ACM Transactions on Economics and Computation (TEAC)
影响因子:
--
通讯作者:
Dominik
Dominik
中科院分区:
--
文献类型:
--
作者:
Brandl;Florian;Brandt;Harrenstein;Martin;Peters;Dominik

文献摘要

参考文献

被引文献

相似文献

我们在本文中提出的工作启动了对分数享乐博弈(FHG)的正式研究,这是一种联盟形成博弈,其中玩家的效用是他赋予联盟成员的平均价值。在其他设置中,这涵盖了玩家仅区分朋友和非朋友并希望加入朋友比例最大的联盟的情况。因此,FHG 不仅构成了一类可简洁表示的联盟形成博弈,而且还为网络聚类提供了一个有趣的框架。我们提出了 FHG 核心非空的多种条件,并提供了计算核心稳定结果的算法。相比之下,我们表明在其他情况下核心可能是空的,并且通常在计算上很难确定核心的非空。
The work we present in this article initiated the formal study offractional hedonic games(FHGs), coalition formation games in which the utility of a player is the average value he ascribes to the members of his coalition. Among other settings, this covers situations in which players only distinguish between friends and non-friends and desire to be in a coalition in which the fraction of friends is maximal. FHGs thus not only constitute a natural class of succinctly representable coalition formation games but also provide an interesting framework for network clustering. We propose a number of conditions under which the core of FHGs is non-empty and provide algorithms for computing a core stable outcome. By contrast, we show that the core may be empty in other cases, and that it is computationally hard in general to decide non-emptiness of the core.
享乐游戏复杂性的简单原因
DOI: --
发表时间: 2015
期刊: International Joint Conference on Artificial Intelligence
影响因子: --
作者:
Dominik Peters;Edith Elkind
通讯作者: Edith Elkind
利他享乐游戏
DOI: --
发表时间: 2016
期刊: Adaptive Agents and Multi-Agent Systems
影响因子: --
作者:
Nhan;Anja Rey;Lisa Rey;J. Rothe;Lena Schend
通讯作者: Lena Schend
享乐游戏中帕累托最优的代价
DOI: --
发表时间: 2016
期刊: AAAI Conference on Artificial Intelligence
影响因子: --
作者:
Edith Elkind;A. Fanelli;M. Flammini
通讯作者: M. Flammini
稳定分区问题
DOI: --
发表时间: 2008
期刊: Encyclopedia of Algorithms
影响因子: --
作者:
K. Cechlárová
通讯作者: K. Cechlárová
DOI: 10.1007/s10472-015-9461-y
发表时间: 2015
影响因子: 1.2
作者:
Anja Rey;J. Rothe;Hilmar Schadrack;Lena Schend
通讯作者: Lena Schend