Extended Pair Approximation of Evolutionary Game on Complex Networks
From MaRDI portal
Abstract: We investigate how network structure influences evolutionary games on networks. We extend the pair approximation to study the effects of degree fluctuation and clustering of the network. We find that a larger fluctuation of the degree is equivalent to a larger mobility of the players. In addition, a larger clustering coefficient is equivalent to a smaller number of neighbors.
Recommendations
- Lumping evolutionary game dynamics on networks
- Evolutionary games and networks
- Evolutionary stability for games played on networks
- The evolution game based on the complex network
- Stability of strategies in payoff-driven evolutionary games on networks
- Evolutionary compromise game on assortative mixing networks
- Time scales in evolutionary game on adaptive networks
Cited in
(9)- Diffusively-coupled rock-paper-scissors game with mutation in scale-free hierarchical networks
- Methods for approximating stochastic evolutionary dynamics on graphs
- Approximating evolutionary dynamics on networks using a neighbourhood configuration model
- Game theoretical modelling of a dynamically evolving network. II: Target sequences of score 1
- A condition for cooperation in a game on complex networks
- Moran-evolution of cooperation: from well-mixed to heterogeneous complex networks
- Invasion and expansion of cooperators in lattice populations: prisoner's dilemma vs. snowdrift games
- The evolution of price competition game on complex networks
- A power law network in an evolutionary hawk-dove game
This page was built for publication: Extended Pair Approximation of Evolutionary Game on Complex Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3529121)
