Synchronisation Games on Hypergraphs
Synchronisation Games on Hypergraphs
复制标题
超图同步博弈
DOI:
--
复制
发表时间:
2017
期刊:
影响因子:
--
通讯作者:
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