Preprint Article Version 1 This version is not peer-reviewed

Algorithm for Evolutionarily Stable Strategies against Pure Mutations

Version 1 : Received: 1 March 2018 / Approved: 5 March 2018 / Online: 5 March 2018 (03:28:43 CET)

How to cite: Ganzfried, S. Algorithm for Evolutionarily Stable Strategies against Pure Mutations. Preprints 2018, 2018030027 (doi: 10.20944/preprints201803.0027.v1). Ganzfried, S. Algorithm for Evolutionarily Stable Strategies against Pure Mutations. Preprints 2018, 2018030027 (doi: 10.20944/preprints201803.0027.v1).

Abstract

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.

Subject Areas

game theory; equilibrium computation; evolutionarily stable strategy; biological applications; cancer

Readers' Comments and Ratings (0)

Leave a public comment
Send a private comment to the author(s)
Rate this article
Views 0
Downloads 0
Comments 0
Metrics 0
Leave a public comment

×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.