Bishop–Cannings theorem
The Bishop–Cannings theorem is a
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
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]
Notes
- ^ Bishop, D.T. and Cannings, C. (1978). A generalized war of attrition. Journal of Theoretical Biology 70:85–124.
- ^ Maynard Smith, J. 1982 Evolution and the Theory of Games, Cambridge University Press.
 | This game theory article is a stub. You can help Wikipedia by expanding it. |