Symmetric versus asymmetric equilibria in symmetric supermodular games

This paper investigates the general properties of symmetric n-player supermodular games with complete-lattice action spaces. In particular, we examine the extent to which all pure strategy Nash equilibria tend to be symmetric for the general case of multi-dimensional strategy spaces. As asymmetric equilibria are possible even for strictly supermodular games, we investigate whether some symmetric equilibrium would always Pareto dominate all asymmetric equilibria. While this need not hold in general, we identify different sufficient conditions, each of which guarantees that such dominance holds: 2-player games with scalar action sets, uni-signed externalities, identical interests, and superjoin payoffs. Various illustrative examples are provided. Finally, some economic applications are discussed.