Preliminary Draft – January 3 , 2007 Symmetries and the Complexity of Pure Nash Equilibrium ∗

Abstract

Strategic games may exhibit symmetries in a variety of ways. A common aspect, enabling the compact representation of games even when the number of players is unbounded, is that players cannot (or need not) distinguish between the other players. We define four classes of symmetric games by considering two additional properties: identical payoff functions for… (More)

Topics

6 Figures and Tables

Slides referencing similar topics