Cheating in evolutionary games

Abstract

The analysis of models of evolutionary games requires explicit consideration of both evolutionary game rules and mutants which infinitesimally break these rules. For example, the Scotch Auction is an evolutionary game which lacks both a rule-obeying evolutionarily stable strategy and an asymptotically stable polymorphism of rule-obeying strategies. However, an infinitesimal rule-breaking, or cheating, mutant can be found which is an evolutionarily stable strategy against rule-obeying strategies. Such cheating strategies can spread through populations initially playing the Scotch Auction, effectively changing the rules of the game. Moreover, the extent of such rule-change will then tend to increase. Thus, the Scotch Auction is a transient evolutionary game, being the initial point of a seemingly orthogenetic game evolutionary process. This sort of transience suggests that the “progressive” nature of evolution may be due in part to those game features of evolutionary processes which make the success of adaptations relative to the level of extant adaptation among competitors, predators, etc.