z-logo
open-access-imgOpen Access
The evolutionary spatial snowdrift game on a cycle: An asymptotic analysis
Author(s) -
Benedikt Valentin Meylahn,
AUTHOR_ID,
Jan H. van Vuuren,
AUTHOR_ID
Publication year - 2021
Publication title -
open journal of discrete applied mathematics
Language(s) - English
Resource type - Journals
eISSN - 2617-9687
pISSN - 2617-9679
DOI - 10.30538/psrp-odam2021.0063
Subject(s) - computer science , sequential game , evolutionary dynamics , outcome (game theory) , mathematical economics , evolutionary game theory , graph , vertex (graph theory) , combinatorial game theory , game theory , mathematics , theoretical computer science , population , demography , sociology
The temporal dynamics of games have been studied widely in evolutionary spatial game theory using simulation. Each player is usually represented by a vertex of a graph and plays a particular game against every adjacent player independently. These games result in payoffs to the players which affect their relative fitness. The fitness of a player, in turn, affects its ability to reproduce. In this paper, we analyse the temporal dynamics of the evolutionary 2-person, 2-strategy snowdrift game in which players are arranged along a cycle of arbitrary length. In this game, each player has the option of adopting one of two strategies, namely cooperation or defection, during each game round. We compute the probability of retaining persistent cooperation over time from a random initial assignment of strategies to players. We also establish bounds on the probability that a small number of players of a particular mutant strategy introduced randomly into a cycle of players which have established the opposite strategy leads to the situation where all players eventually adopt the mutant strategy. We adopt an analytic approach throughout as opposed to a simulation approach clarifying the underlying dynamics intrinsic to the entire class of evolutionary spatial snowdrift games.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here