Evolutionary game on networks with high clustering coefficient

Abstract

This study investigates the influence of lattice structure in evolutionary games. The snowdrift game and the prisoner's dilemma game are considered in networks with high clustering coefficients, that use four different strategy-updating. Analytical conjectures using pair approximation were compared with the numerical results. Results indicate that the clustering coefficient does not influence the evolution of cooperation in the prisoner's dilemma game, while it does in the snow-drift game. Lattice structure yields high ‘effective’ clustering coefficient and enhances the frequency of the majority rather than cooperators.