Two-strategy games with time constraints on regular graphs
From MaRDI portal
Publication:827746
DOI10.1016/J.JTBI.2020.110426zbMath1455.91044OpenAlexW3047873655WikidataQ98298067 ScholiaQ98298067MaRDI QIDQ827746
Publication date: 13 January 2021
Published in: Journal of Theoretical Biology (Search for Journal in Brave)
Full work available at URL: https://openaccess.city.ac.uk/id/eprint/24906/8/BKtwostrategyaccepted.pdf
evolutionary game theoryprisoner's dilemmahawk-dove gamebirth-death and death-birth updatinggames on regular graphs
Related Items (2)
The asymmetric hawk-dove game with costs measured as time lost ⋮ Using chemical reaction network theory to show stability of distributional dynamics in game theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general framework for analysing multiplayer games in networks using territorial interactions as a case study
- Directionality of contact networks suppresses selection pressure in evolutionary dynamics
- Evolving multiplayer networks: modelling the evolution of cooperation in a mobile population
- Evolutionary dynamics and the evolution of multiplayer cooperation in a subdivided population
- Beyond replicator dynamics: from frequency to density dependent models of evolutionary games
- Bimatrix games that include interaction times alter the evolutionary outcome: the owner-intruder game
- The ESS and replicator equation in matrix games under time constraints
- Interaction times change evolutionary outcomes: two-player matrix games
- Evolutionary stability for matrix games under time constraints
- Know when to walk away: contingent movement and the evolution of cooperation
- Active linking in evolutionary games
- Revisiting the ``fallacy of averages in ecology: expected gain per unit time equals expected gain divided by expected time
- Evolutionary game dynamics with non-uniform interaction rates
- Evolutionary games on graphs and the speed of the evolutionary process
- Evolutionary Games and Population Dynamics
- The Logic of Animal Conflict
- An analysis of the fixation probability of a mutant on special classes of non-directed graphs
This page was built for publication: Two-strategy games with time constraints on regular graphs