Synchronisation Games on Hypergraphs

Synchronisation Games on Hypergraphs
复制标题

超图同步博弈

DOI:
--
复制
发表时间:
2017
期刊:
International Joint Conference on Artificial Intelligence
影响因子:
--
通讯作者:
D. Wojtczak
D. Wojtczak
中科院分区:
--
文献类型:
--
作者:
Sunil Simon;D. Wojtczak

文献摘要

参考文献

被引文献

相似文献

我们研究了超图上的战略博弈模型,其中玩家以节点为模型,试图在某些玩家群体中协调或反协调他们的选择,以超边为模型。我们表明,这个模型是一个严格的广义的对称加法可分离的享乐游戏的超图设置,这样的游戏总是有一个纯纳什均衡,可以计算在伪多项式时间。此外,在纯协调设置,我们证明了一个强平衡存在,并可以在多项式时间内计算的游戏具有一定的非循环结构。
We study a strategic game model on hypergraphs where players, modelled by nodes, try to coordinate or anti-coordinate their choices within certain groups of players, modelled by hyperedges. We show this model to be a strict generalisation of symmetric additively separable hedonic games to the hypergraph setting and that such games always have a pure Nash equilibrium, which can be computed in pseudo-polynomial time. Moreover, in the pure coordination setting, we show that a strong equilibrium exists and can be computed in polynomial time when the game possesses a certain acyclic structure.
有向图上的协调博弈
DOI: --
发表时间: 2015
期刊: --
影响因子: --
作者:
Apt KR
通讯作者: Apt KR