Coordination Games on Directed Graphs
Computer Science and Game Theory
2016-06-27 v1
Abstract
We study natural strategic games on directed graphs, which capture the idea of coordination in the absence of globally common strategies. We show that these games do not need to have a pure Nash equilibrium and that the problem of determining their existence is NP-complete. The same holds for strong equilibria. We also exhibit some classes of games for which strong equilibria exist and prove that a strong equilibrium can then be found in linear time.
Keywords
Cite
@article{arxiv.1606.07517,
title = {Coordination Games on Directed Graphs},
author = {Krzysztof R. Apt and Sunil Simon and Dominik Wojtczak},
journal= {arXiv preprint arXiv:1606.07517},
year = {2016}
}
Comments
In Proceedings TARK 2015, arXiv:1606.07295