Related papers: Fixation and escape times in stochastic game learn…
Evolutionary game theory has traditionally employed deterministic models to describe population dynamics. These models, due to their inherent nonlinearities, can exhibit deterministic chaos, where population fluctuations follow complex,…
In this paper, we consider a two-player two-strategy game with random payoffs in a population subdivided into $d$ demes, each containing $N$ individuals at the beginning of any given generation and experiencing local extinction and…
In this paper, we examine the long-run behavior of regularized, no-regret learning in finite games. A well-known result in the field states that the empirical frequencies of no-regret play converge to the game's set of coarse correlated…
Starting from a heuristic learning scheme for N-person games, we derive a new class of continuous-time learning dynamics consisting of a replicator-like drift adjusted by a penalty term that renders the boundary of the game's strategy space…
In evolutionary dynamics, the probability that a mutation spreads through the whole population, having arisen in a single individual, is known as the fixation probability. In general, it is not possible to find the fixation probability…
The game interactions among individuals in nature are often uncertain and dynamically evolving, significantly influencing the persistence of cooperation. However, it remains a formidable challenge to effectively characterize these dynamic…
In binary decision-making, individuals often choose either the rare or the common action. In the framework of evolutionary game theory, the best-response update rule can be used to model this dichotomy. Those who prefer the common action…
Evolutionary games on networks traditionally involve the same game at each interaction. Here we depart from this assumption by considering mixed games, where the game played at each interaction is drawn uniformly at random from a set of two…
We model evolution according to an asymmetric game as occurring in multiple finite populations, one for each role in the game, and study the effect of subjecting individuals to stochastic strategy mutations. We show that, when these…
The paper presents a model of two-speed evolution in which the payoffs in the population game (or, alternatively, the individual preferences) slowly adjust to changes in the aggregate behavior of the population. The model investigates how,…
We establish a theoretical framework to address evolutionary dynamics of spatial games under strong selection. As the selection intensity tends to infinity, strategy competition unfolds in the deterministic way of winners taking all. We…
We discuss a model for evolutionary game dynamics in a growing, network-structured population. In our model, new players can either make connections to random preexisting players or preferentially attach to those that have been successful…
We investigate the statistics of the time taken for a system driven by recruitment to reach fixation. Our model describes a series of experiments where a population is confronted with two identical options, resulting in the system fixating…
We study adaptive learning in a typical p-player game. The payoffs of the games are randomly generated and then held fixed. The strategies of the players evolve through time as the players learn. The trajectories in the strategy space…
The modelling of evolutionary game dynamics in finite populations requires microscopic processes that determine how strategies spread. The exact details of these processes are often chosen without much further consideration. Different types…
Evolutionary branching is analysed in a stochastic, individual-based population model under mutation and selection. In such models, the common assumption is that individual reproduction and life career are characterised by values of a…
Continuously changing environments have a paramount role in the evolution of cooperative behavior. Previous works have shown that the transitions among different games, as the feedback between behaviors and environments, can promote…
When a prediction algorithm serves a collection of users, disparities in prediction quality are likely to emerge. If users respond to accurate predictions by increasing engagement, inviting friends, or adopting trends, repeated learning…
Imitating successful behavior is a natural and frequently applied approach to trust in when facing scenarios for which we have little or no experience upon which we can base our decision. In this paper, we consider such behavior in atomic…
Weak selection, which means a phenotype is slightly advantageous over another, is an important limiting case in evolutionary biology. Recently it has been introduced into evolutionary game theory. In evolutionary game dynamics, the…