This paper proposes a novel way to compare classes of strategic games based on their sets of pure Nash equilibria. This approach is then used to relate the classes of zero-sum games, polymatrix, and k-polymatrix games. This paper concludes with a conjecture that k-polymatrix games form an increasing chain of classes.
Online reinforcement learning multiplayer non-zero sum games of continuous-time Markov jump linear systems
