Replicator equation

{{Short description|Dynamical system}}

In mathematics, the replicator equation is a type of dynamical system used in evolutionary game theory to model how the frequency of strategies in a population changes over time. It is a deterministic, monotone, non-linear, and non-innovative dynamic that captures the principle of natural selection in strategic interactions.{{Cite journal|last1=Hofbauer|first1=Josef|last2=Sigmund|first2=Karl|date=2003|title=Evolutionary game dynamics|url=https://www.ams.org/bull/2003-40-04/S0273-0979-03-00988-1/|journal=Bulletin of the American Mathematical Society|volume=40|issue=4|pages=479–519|doi=10.1090/S0273-0979-03-00988-1|issn=0273-0979|doi-access=free}}

The replicator equation describes how strategies with higher-than-average fitness increase in frequency, while less successful strategies decline. Unlike other models of replication—such as the quasispecies model—the replicator equation allows the fitness of each type to depend dynamically on the distribution of population types, making the fitness function an endogenous component of the system. This allows it to model frequency-dependent selection, where the success of a strategy depends on its prevalence relative to others.

Another key difference from the quasispecies model is that the replicator equation does not include mechanisms for mutation or the introduction of new strategies, and is thus considered non-innovative. It assumes all strategies are present from the outset and models only the relative growth or decline of their proportions over time.

Replicator dynamics have been widely applied in fields such as biology (to study evolution and population dynamics), economics (to analyze bounded rationality and strategy evolution), and machine learning (particularly in multi-agent systems and reinforcement learning).

Equation

The most general continuous form of the replicator equation is given by the differential equation:{{Equation box 1|cellpadding|border|indent=:|equation= \dot{x_i} = x_i [ f_i(x) - \phi(x)], \quad \phi(x) = \sum_{j=1}^{n}{x_j f_j(x)} |border colour=#0073CF|background colour=#F5FFFA}}where x_i is the proportion of type i in the population, x=(x_1, \ldots, x_n) is the vector of the distribution of types in the population, f_i(x) is the fitness of type i (which is dependent on the population), and \phi(x) is the average population fitness (given by the weighted average of the fitness of the n types in the population). Since the elements of the population vector x sum to unity by definition, the equation is defined on the n-dimensional simplex.

The replicator equation assumes a uniform population distribution; that is, it does not incorporate population structure into the fitness. The fitness landscape does incorporate the population distribution of types, in contrast to other similar equations, such as the quasispecies equation.

In application, populations are generally finite, making the discrete version more realistic. The analysis is more difficult and computationally intensive in the discrete formulation, so the continuous form is often used, although there are significant properties that are lost due to this smoothing. Note that the continuous form can be obtained from the discrete form by a limiting process.

To simplify analysis, fitness is often assumed to depend linearly upon the population distribution, which allows the replicator equation to be written in the form:

:\dot{x_i}=x_i\left(\left(Ax\right)_i-x^TAx\right)

where the payoff matrix A holds all the fitness information for the population: the expected payoff can be written as \left(Ax\right)_i and the mean fitness of the population as a whole can be written as x^TAx. It can be shown that the change in the ratio of two proportions x_{i}/x_{j} with respect to time is:{d\over{dt}}\left( {x_{i}\over{x_{j}}} \right) = {x_{i}\over{x_{j}}} \left[ f_{i}(x) - f_{j}(x) \right]In other words, the change in the ratio is driven entirely by the difference in fitness between types.

= Derivation of deterministic and stochastic replicator dynamics =

Suppose that the number of individuals of type i is N_{i} and that the total number of individuals is N. Define the proportion of each type to be x_{i} = N_{i}/N. Assume that the change in each type is governed by geometric Brownian motion:dN_{i} = f_{i}N_{i}dt + \sigma_{i}N_{i}dW_{i}where f_{i} is the fitness associated with type i. The average fitness of the types \phi = x^{T}f. The Wiener processes are assumed to be uncorrelated. For x_{i}(N_{1},...,N_{m}), Itô's lemma then gives us:\begin{aligned}

dx_{i}(N_{1},...,N_{m}) &= {\partial x_{i}\over{\partial N_{j}}}dN_{j} + {1\over{2}}{\partial^{2}x_{i}\over{\partial N_{j}\partial N_{k}}}dN_{j}dN_{k} \\

&= {\partial x_{i}\over{\partial N_{j}}}dN_{j} + {1\over{2}}{\partial^{2}x_{i}\over{\partial N_{j}^{2}}}(dN_{j})^{2}

\end{aligned}The partial derivatives are then:\begin{aligned}

{\partial x_{i}\over{\partial N_{j}}} &= {1\over{N}}\delta_{ij} - {x_{i}\over{N}} \\

{\partial^{2} x_{i}\over{\partial N_{j}^{2}}} &= -{2\over{N^{2}}}\delta_{ij} + {2x_{i}\over{N^{2}}}

\end{aligned}where \delta_{ij} is the Kronecker delta function. These relationships imply that:dx_{i} = {dN_{i}\over{N}} -x_{i}\sum_{j}{dN_{j}\over{N}} - {(dN_{i})^{2}\over{N^{2}}} + x_{i}\sum_{j}{(dN_{j})^{2}\over{N^{2}}}Each of the components in this equation may be calculated as:\begin{aligned}

{dN_{i}\over{N}} &= f_{i}x_{i}dt + \sigma_{i}x_{i}dW_{i} \\

-x_{i}\sum_{j}{dN_{j}\over{N}} &= -x_{i}\left(\phi dt + \sum_{j}\sigma_{j}x_{j}dW_{j} \right) \\

-{(dN_{i})^{2}\over{N^{2}}} &= -\sigma_{i}^{2}x_{i}^{2}dt \\

x_{i}\sum_{j}{(dN_{j})^{2}\over{N^{2}}} &= x_{i}\left( \sum_{j}\sigma_{j}^{2}x_{j}^{2}\right )dt

\end{aligned}Then the stochastic replicator dynamics equation for each type is given by:dx_{i} = x_{i}\left(f_{i} -\phi-\sigma_{i}^{2}x_{i} + \sum_{j}\sigma_{j}^{2}x_{j}^{2} \right)dt + x_{i}\left(\sigma_{i}dW_{i}-\sum_{j}\sigma_{j}x_{j}dW_{j} \right )Assuming that the \sigma_{i} terms are identically zero, the deterministic replicator dynamics equation is recovered.

Analysis

{{Main|Evolutionarily stable state}}

The analysis differs in the continuous and discrete cases: in the former, methods from differential equations are utilized, whereas in the latter the methods tend to be stochastic. Since the replicator equation is non-linear, an exact solution is difficult to obtain (even in simple versions of the continuous form) so the equation is usually analyzed in terms of stability. The replicator equation (in its continuous and discrete forms) satisfies the folk theorem of evolutionary game theory which characterizes the stability of equilibria of the equation. The solution of the equation is often given by the set of evolutionarily stable states of the population.

In general nondegenerate cases, there can be at most one interior evolutionary stable state (ESS), though there can be many equilibria on the boundary of the simplex. All the faces of the simplex are forward-invariant which corresponds to the lack of innovation in the replicator equation: once a strategy becomes extinct there is no way to revive it.

Phase portrait solutions for the continuous linear-fitness replicator equation have been classified in the two and three dimensional cases. Classification is more difficult in higher dimensions because the number of distinct portraits increases rapidly.

Relationships to other equations

The continuous replicator equation on n types is equivalent to the Generalized Lotka–Volterra equation in n-1 dimensions.{{Cite journal|last=Bomze|first=Immanuel M.|date=1983-10-01|title=Lotka-Volterra equation and replicator dynamics: A two-dimensional classification|journal=Biological Cybernetics|language=en|volume=48|issue=3|pages=201–211|doi=10.1007/BF00318088|s2cid=206774680|issn=1432-0770}}{{Cite journal|last=Bomze|first=Immanuel M.|date=1995-04-01|title=Lotka-Volterra equation and replicator dynamics: new issues in classification|journal=Biological Cybernetics|language=en|volume=72|issue=5|pages=447–453|doi=10.1007/BF00201420|s2cid=18754189|issn=1432-0770}} The transformation is made by the change of variables:

:x_i = \frac{y_i}{1 + \sum_{j=1}^{n-1}{y_j}} \quad i=1, \ldots,n-1

:x_n = \frac{1}{1 + \sum_{j=1}^{n-1}{y_j}},

where y_i is the Lotka–Volterra variable. The continuous replicator dynamic is also equivalent to the Price equation.{{Cite journal|last1=Page|first1=KAREN M.|last2=Nowak|first2=MARTIN A.|date=2002-11-07|title=Unifying Evolutionary Dynamics|url=http://www.sciencedirect.com/science/article/pii/S0022519302931127|journal=Journal of Theoretical Biology|language=en|volume=219|issue=1|pages=93–98|doi=10.1006/jtbi.2002.3112|pmid=12392978|bibcode=2002JThBi.219...93P |issn=0022-5193|url-access=subscription}}

Discrete replicator equation

When one considers an unstructured infinite population with non-overlapping generations, one should work with the discrete forms of the replicator equation. Mathematically, two simple phenomenological versions---

: x'_{i} = x_i + x_i \left[\left(Ax\right)_i-x^TAx\right] \,(\rm type~I),

: x'_{i} = x_i\left[\frac{\left(Ax\right)_i}{x^TAx}\right]\, (\rm type~II),

---are consistent with the Darwinian tenet of natural selection or any analogous evolutionary phenomena. Here, prime stands for the next time step. However, the discrete nature of the equations puts bounds on the payoff-matrix elements.{{Cite journal|last1=Pandit|first1=Varun|last2=Mukhopadhyay|first2=Archan|last3=Chakraborty|first3=Sagar|date=2018|title=Weight of fitness deviation governs strict physical chaos in replicator dynamics.|journal=Chaos|language=en|volume=28|number=3|pages=033104|doi=10.1063/1.5011955|pmid=29604653|arxiv=1703.10767|bibcode=2018Chaos..28c3104P|s2cid=4559066}} Interestingly, for the simple case of two-player-two-strategy games, the type I replicator map is capable of showing period doubling bifurcation leading to chaos and it also gives a hint on how to generalize{{Cite journal|last1=Mukhopadhyay|first1=Archan|last2=Chakraborty|first2=Sagar|date=2020|title=Periodic Orbit can be Evolutionarily Stable: Case Study of Discrete Replicator Dynamics.|url=https://www.sciencedirect.com/science/article/pii/S0022519320301430|journal=Journal of Theoretical Biology|language=en|volume=497|pages=110288|doi=10.1016/j.jtbi.2020.110288|pmid=32315673|arxiv=2102.11034|bibcode=2020JThBi.49710288M |s2cid=216073761 }} the concept of the evolutionary stable state to accommodate the periodic solutions of the map.

Generalizations

A generalization of the replicator equation which incorporates mutation is given by the replicator-mutator equation, which takes the following form in the continuous version:{{Cite book|last=Nowak|first=Martin A.|title=Evolutionary Dynamics: Exploring the Equations of Life|publisher=Belknap Press|year=2006|isbn=978-0674023383|pages=272–273}}

: \dot{x_i} = \sum_{j=1}^{n}{x_j f_j(x) Q_{ji}} - \phi(x)x_i,

where the matrix Q gives the transition probabilities for the mutation of type j to type i , f_i is the fitness of the i^{th} and \phi is the mean fitness of the population. This equation is a simultaneous generalization of the replicator equation and the quasispecies equation, and is used in the mathematical analysis of language.

The discrete version of the replicator-mutator equation may have two simple types in line with the two replicator maps written above:

: x'_{i} = x_i + \sum_{j=1}^{n}{x_j f_j(x) Q_{ji}} - \phi(x)x_i,

and

: x'_{i} = \frac{\sum_{j=1}^{n}{x_j f_j(x) Q_{ji}}}{\phi(x)},

respectively.

The replicator equation or the replicator-mutator equation can be extended{{Cite journal|last1=Alboszta|first1=Jan|last2=Miękisz|first2=Jacek|date=2004|title=Stability of evolutionarily stable strategies in discrete replicator dynamicswithtimedelay|url=https://www.sciencedirect.com/science/article/pii/S0022519304002851|journal=Journal of Theoretical Biology|language=en|volume=231|issue=2|pages=175–179|doi=10.1016/j.jtbi.2004.06.012|pmid=15380382|arxiv=q-bio/0409024|bibcode=2004JThBi.231..175A |s2cid=15308310}} to include the effect of delay that either corresponds to the delayed information about the population state or in realizing the effect of interaction among players. The replicator equation can also easily be generalized to asymmetric games. A recent generalization that incorporates population structure is used in evolutionary graph theory.{{Cite journal|last1=Lieberman|first1=Erez|last2=Hauert|first2=Christoph|last3=Nowak|first3=Martin A.|date=2005|title=Evolutionary dynamics on graphs|url=https://www.nature.com/articles/nature03204|journal=Nature|language=en|volume=433|issue=7023|pages=312–316|doi=10.1038/nature03204|pmid=15662424|bibcode=2005Natur.433..312L|s2cid=4386820|issn=1476-4687|url-access=subscription}}

References

Further reading

  • Cressman, R. (2003). [https://books.google.com/books?id=187BOmBvyvQC&q=%22Replicator+equation%22 Evolutionary Dynamics and Extensive Form Games] The MIT Press.
  • Taylor, P.D.; Jonker, L. (1978). "Evolutionary Stable Strategies and Game Dynamics". Mathematical Biosciences, 40: 145–156.
  • Sandholm, William H. (2010). Population Games and Evolutionary Dynamics. Economic Learning and Social Evolution, The MIT Press.

{{game theory}}

Category:Differential equations

Category:Evolutionary game theory

Category:Evolutionary dynamics

Category:Mathematical and theoretical biology

Category:Mathematical economics