Algorithm for Evolutionarily Stable Strategies Against Pure Mutations

03/01/2018
by   Sam Ganzfried, et al.
0

Evolutionarily stable strategy (ESS) is an important solution concept in game theory which has been applied frequently to biology and even cancer. Finding such a strategy has been shown to be difficult from a theoretical complexity perspective. Informally an ESS is a strategy that if followed by the population cannot be taken over by a mutation strategy. We present an algorithm for the case where mutations are restricted to pure strategies. This is the first positive result for computation of ESS, as all prior results are computational hardness and no prior algorithms have been presented.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/13/2013

Mixed Strategy May Outperform Pure Strategy: An Initial Study

In pure strategy meta-heuristics, only one search strategy is applied fo...
research
12/07/2011

Pure Strategy or Mixed Strategy?

Mixed strategy EAs aim to integrate several mutation operators into a si...
research
08/21/1998

Chess Pure Strategies are Probably Chaotic

It is odd that chess grandmasters often disagree in their analysis of po...
research
05/06/2018

The Exact Computational Complexity of Evolutionarily Stable Strategies

While the computational complexity of many game-theoretic solution conce...
research
08/27/2011

Providing information can be a stable non-cooperative evolutionary strategy

Human language is still an embarrassment for evolutionary theory, as the...
research
07/01/2012

Alternative Restart Strategies for CMA-ES

This paper focuses on the restart strategy of CMA-ES on multi-modal func...
research
06/27/2019

Deception, Delay, and Detection of Strategies

Homology generators in a relation offer individuals the ability to delay...

Please sign up or login with your details

Forgot password? Click here to reset