Evolution of cooperation for multiple mutant configurations on all regular graphs with \(N \leq 14\) players

DOI10.3390/g11010012zbMath1457.91081arXiv1911.03710OpenAlexW3006730629MaRDI QIDQ2221250

Hendrik Richter

Publication date: 26 January 2021

Published in: Games (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.03710

zbMATH Keywords

regular graphsevolutionary game theorystructure coefficientsgraph cyclesfixation propertiesgraph-theoretical properties

Mathematics Subject Classification ID

Games involving graphs (91A43) Evolutionary games (91A22)

Related Items (1)

Spectral analysis of transient amplifiers for death-birth updating constructed from regular graphs

Uses Software

• GENREG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Evolutionary dynamics of a smoothed war of attrition game
• A linear time algorithm for finding all hinge vertices of a permutation graph
• Structure coefficients and strategy selection in multiplayer games
• Strategy selection in structured populations
• Evolutionary game theory: a renaissance
• Spatial invasion of cooperation
• Sharp benefit-to-cost rules for the evolution of cooperation on regular graphs
• The replicator equation on graphs
• Evolutionary graph theory: breaking the symmetry between interaction and replacement
• Games on graphs
• Dynamic properties of evolutionary multi-player games in finite populations
• A general purpose algorithm for counting simple cycles and simple paths of any length
• Fitness-based models and pairwise comparison models of evolutionary games are typically different—even in unstructured populations
• Fast generation of regular graphs and construction of cages
• Birth–death fixation probabilities for structured populations
• Evolutionary graph theory revisited: when is an evolutionary process equivalent to the Moran process?

This page was built for publication: Evolution of cooperation for multiple mutant configurations on all regular graphs with \(N \leq 14\) players