Counting Stable Strategies in Random Evolutionary Games

In this paper we study the notion of the Evolutionary Stable Strategies (ESS) in evolutionary games and we demonstrate their qualitative difference from the Nash Equilibria, by showing that a random evolutionary game has on average exponentially less number of ESS than the number of Nash Equilibria in the underlying symmetric 2-person game with random payoffs.

• Type: Conference
• Year: 2005
• Where: ISAAC
• Authors: Spyros C. Kontogiannis, Paul G. Spirakis
• Keywords: Evolutionary Game, Evolutionary Stable Strategies, ISAAC 2005, Nash Equilibria