 Symmetric finite game

A finite game is symmetric when all players have the same pure strategies and permuting the players permutes their payoffs. In the anonymous special case, a player's payoff depends on their own action and the multiset of opposing actions. A symmetric equilibrium exists even when there are more than two players, by the gain-map proof of symmetric equilibrium.