Bishop-Cannings theorem

From Wikipedia, the free encyclopedia

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^[1] (from their Theorem 3). The usefulness of the results comes from the fact that they can be used to directly find ESSes algebraically, rather than simulating the game and solving it by iteration.

The logic of (i) also applies to Nash equilibria (all strategies in the support of a mixed strategy receive the same payoff).^{[citation needed]}

The theorem was formulated by Tim Bishop and Chris Cannings at Sheffield University, who published it in 1978.

A review is given by John Maynard Smith in Evolution and the Theory of Games, with proof in the appendix^[2]

[edit] References

1. ^ Bishop, D.T. and Cannings, C. (1978). A generalized war of attrition. Journal of Theoretical Biology 70:85–124.
2. ^ Maynard Smith, J. 1982 Evolution and the Theory of Games, Cambridge University Press.

[edit] External links

Prestwich, K.. The Bishop–Cannings Theorem (an annotated version of John Maynard Smith's exposition of the The Bishop–Cannings Theorem).