Coordination Games on Directed Graphs
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...
| Published in: | Electronic Proceedings in Theoretical Computer Science |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Published: |
Open Publishing Association
2016-06-01
|
| Online Access: | http://arxiv.org/pdf/1606.07517v1 |
| Summary: | 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. |
|---|---|
| ISSN: | 2075-2180 |