Abstract
We present an algorithm for computing all evolutionarily stable strategies in nondegenerate normal-form games with three or more players.
Computing Evolutionarily Stable Strategies in Multiplayer Games
Related papers
Ranked by semantic similarity — how closely each paper's abstract matches this one (100% = near-identical topic).
- Evolutionarily Stable Preferences Against Multiple Mutations in Multi-player Games (2018)69% match
- Insuperable strategies in two-player and reducible multi-player games (2025)67% match
- Optimization-Based Algorithm for Evolutionarily Stable Strategies against Pure Mutations (2018)66% match
- Evolutionary Algorithms for Computing Nash Equilibria in Dynamic Games (2026)66% match
- The Exact Computational Complexity of Evolutionarily Stable Strategies (2018)66% match
- Computing Evolutionarily Stable Strategies in Imperfect-Information Games (2025)65% match
- Markov perfect equilibria in non-stationary mean-field games (2019)64% match
- Evolutionary Games on Infinite Strategy Sets: Convergence to Nash Equilibria via Dissipativity (2023)63% match