Bishop-Cannings theorem

In game theory, the Bishop-Cannings theorem proves that all members of a mixed evolutionarily stable strategy have the same payoff, and that none of these can also be a pure evolutionarily stable strategy.