  While the computational complexity of many game-theoretic solution concepts,
notably Nash equilibrium, has now been settled, the question of determining the
exact complexity of computing an evolutionarily stable strategy has resisted
solution since attention was drawn to it in 2004. In this paper, I settle this
question by proving that deciding the existence of an evolutionarily stable
strategy is $\Sigma_2^P$-complete.
