From fixation probabilities to d-player games: an inverse problem in evolutionary dynamics
Fabio A. C. C. Chalub, Max O. Souza

TL;DR
This paper develops a method to infer the underlying game interactions in a population from observed fixation probabilities, using inverse modeling and d-player game approximation to reveal hidden interaction structures.
Contribution
It introduces an inverse approach to deduce the game-theoretic interactions from fixation patterns, extending the analysis with d-player game approximations for detailed insights.
Findings
Any fixation pattern can be realized by a fitness function in the Wright-Fisher model.
Such fitness functions can be approximated by d-player games with arbitrary precision.
The resulting payoff matrix reveals interaction structures not apparent from fixation data.
Abstract
The probability that the frequency of a particular trait will eventually become unity, the so-called fixation probability, is a central issue in the study of population evolution. Its computation, once we are given a stochastic finite population model without mutations and a (possibly frequency dependent) fitness function, is straightforward and it can be done in several ways. Nevertheless, despite the fact that the fixation probability is an important macroscopic property of the population, its precise knowledge does not give any clear information about the interaction patterns among individuals in the population. Here we address the inverse problem: From a given fixation pattern and population size, we want to infer what is the game being played by the population. This is done by first exploiting the framework developed in FACC Chalub and MO Souza, J. Math. Biol. 75: 1735, 2017.,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
