Corpus ID: 214714306

Separable games

@article{Arditti2020SeparableG,
  title={Separable games},
  author={Laura Arditti and Giacomo Como and Fabio Fagnani},
  journal={ArXiv},
  year={2020},
  volume={abs/2003.13128}
}
  • Laura Arditti, Giacomo Como, Fabio Fagnani
  • Published 2020
  • Mathematics, Computer Science
  • ArXiv
  • We introduce the notion of separable games, which refines and generalizes that of graphical games. We prove that there exists a minimal splitting with respect to which a game is separable. Moreover we prove that in every strategic equivalence class, there is a game separable with respect to the minimal splitting in the class. This game is also graphical with respect to the smallest graph in the class, which represent a minimal complexity graphical description for the game. We prove a symmetry… CONTINUE READING

    Citations

    Publications citing this paper.

    Robustness of Nash Equilibria in Network Games

    VIEW 1 EXCERPT
    CITES BACKGROUND