Synchronisation Games on Hypergraphs
Abstract
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.
Cite
Text
Simon and Wojtczak. "Synchronisation Games on Hypergraphs." International Joint Conference on Artificial Intelligence, 2017. doi:10.24963/IJCAI.2017/57Markdown
[Simon and Wojtczak. "Synchronisation Games on Hypergraphs." International Joint Conference on Artificial Intelligence, 2017.](https://mlanthology.org/ijcai/2017/simon2017ijcai-synchronisation/) doi:10.24963/IJCAI.2017/57BibTeX
@inproceedings{simon2017ijcai-synchronisation,
title = {{Synchronisation Games on Hypergraphs}},
author = {Simon, Sunil and Wojtczak, Dominik},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2017},
pages = {402-408},
doi = {10.24963/IJCAI.2017/57},
url = {https://mlanthology.org/ijcai/2017/simon2017ijcai-synchronisation/}
}