Computing Evolutionarily Stable Strategies in Multiplayer Games

2025/11/30 by Sam Ganzfried
#cs.GT #cs.AI #cs.MA #econ.TH #q-bio.PE

paper · pdf

Abstract

We present an algorithm for computing all evolutionarily stable strategies in nondegenerate normal-form games with three or more players.

Citations

• Computational Complexity of Multi-Player Evolutionarily Stable Strategies
• Effects of heterogeneity on cancer: a game theory perspective
• The Exact Computational Complexity of Evolutionarily Stable Strategies
• Gains from switching and evolutionary stability in multi-player matrix\n games
• Gains from switching and evolutionary stability in multi-player matrix games

Related

• Computing Evolutionarily Stable Strategies in Imperfect-Information Games
• Computational Complexity of Multi-Player Evolutionarily Stable Strategies
• Existence of Evolutionarily Stable Strategies Remains Hard to Decide for\n a Wide Range of Payoff Values
• Optimization-Based Algorithm for Evolutionarily Stable Strategies against Pure Mutations
• Evolutionary and asymptotic stability in symmetric multi-player games