A Note on Type-Symmetries in Finite Games

Abstract

In two-action generalized polymatrix games, Nash equilibria are support-type-symmetric, i.e., determined by supports for each type of player. We show that such a property does not generalize straightforwardly for games with at least three actions or where interaction weights have different signs (neither all positive nor negative). A non-trivial condition on interaction weights must be satisfied, which may go unnoticed as it is trivially satisfied for: (i) two-action games, (ii) conformity games, and (iii) congestion games. We derive this condition and the corresponding simplified analytic equation for mixed strategies.

Keywords

• Nash equilibrium
• type-symmetry
• polymatrix games
• non-cooperative games
• network interactions