Bernstein Polynomial Approximation of Fixation Probability in Finite Population Evolutionary Games

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We use the Bernstein polynomials of degree d as the basis for constructing a uniform approximation to the rate of evolution (related to the fixation probability) of a species in a two-component finite-population, well-mixed, frequency-dependent evolutionary game setting. The approximation is valid over the full range 0≤w≤1, where w is the selection pressure parameter, and converges uniformly to the exact solution as d→∞. We compare it to a widely used non-uniform approximation formula in the weak-selection limit (w∼0) as well as numerically computed values of the exact solution. Because of a boundary layer that occurs in the weak-selection limit, the Bernstein polynomial method is more efficient at approximating the rate of evolution in the strong selection region (w∼1) (requiring the use of fewer modes to obtain the same level of accuracy) than in the weak selection regime.

Cite

CITATION STYLE

APA

Park, J., & Newton, P. K. (2024). Bernstein Polynomial Approximation of Fixation Probability in Finite Population Evolutionary Games. Dynamic Games and Applications, 14(3), 686–696. https://doi.org/10.1007/s13235-023-00509-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free