Graphical Games and Decomposition
Computer Science and Game Theory
2020-03-31 v1 Discrete Mathematics
Multiagent Systems
Social and Information Networks
Abstract
We consider graphical games as introduced by Kearns et al. (2001). First we analyse the interaction of graphicality with a notion of strategic equivalence of games, providing a minimal complexity graphical description for games. Then we study the interplay between graphicality and the classical decomposition of games proposed by Candogan et al. (2011), characterizing the graphical properties of each part of the decomposition.
Keywords
Cite
@article{arxiv.2003.13123,
title = {Graphical Games and Decomposition},
author = {Laura Arditti and Giacomo Como and Fabio Fagnani},
journal= {arXiv preprint arXiv:2003.13123},
year = {2020}
}
Comments
4 pages, 2 figures, accepted for presentation at the 21rst IFAC World Congress