Bishop–Cannings theorem

The Bishop–Cannings theorem is a theorem in evolutionary game theory. It states that (i) all members of a mixed evolutionarily stable strategy (ESS) have the same payoff (Theorem 2), and (ii) that none of these can also be a pure ESS (from their Theorem 3).

Source: Wikipedia — Bishop–Cannings theorem (CC BY-SA 4.0)

Bishop–Cannings theorem

The Bishop–Cannings theorem is a theorem in evolutionary game theory. It states that (i) all members of a mixed evolutionarily stable strategy (ESS) have the same payoff (Theorem 2), and (ii) that none of these can also be a pure ESS (from their Theorem 3).

This neuron ends here.

Source: Wikipedia "Bishop–Cannings theorem" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy