Coordination Games on Graphs (Extended Abstract)
We introduce natural strategic games on graphs, which capture the idea of coordination in a local setting. We show that these games have an exact potential and have strong equilibria when the graph is a pseudoforest. We also exhibit some other classes of graphs for which a strong equilibrium exists. However, in general strong equilibria do not need to exist. Further, we study the (strong) price of stability and anarchy. Finally, we consider the problems of computing strong equilibria and of determining whether a joint strategy is a strong equilibrium.
Unable to display preview. Download preview PDF.
- 2.Aumann, R.J.: Acceptable points in general cooperative n-person games. In: Luce, R.D., Tucker, A.W. (eds.) Contribution to the Theory of Game IV. Annals of Mathematical Study, vol. 40, pp. 287–324. University Press (1959)Google Scholar
- 3.Aziz, H., Brandl, F.: Existence of stability in hedonic coalition formation games. In: Proc. 11th International Conference on Autonomous Agents and Multiagent Systems, pp. 763–770 (2012)Google Scholar
- 7.Cechlárová: Stable partition problem. In: Encyclopedia of Algorithms, pp. 885–888 (2008)Google Scholar
- 9.Hoefer, M.: Cost sharing and clustering under distributed competition, Ph.D. Thesis, University of Konstanz (2007)Google Scholar