Promotion of cooperation in the form C0C1D classified by 'degree grads' in a scale-free network

In this paper, we revisit the issue of the public goods game (PGG) on a heterogeneous graph. By introducing a new effective topology parameter, 'degree grads' ψ, we clearly classify the agents into three kinds, namely, C0, C1, and D. The mechanism for the heterogeneous topology promoting cooperation is discussed in detail from the perspective of C0C1D, which reflects the fact that the unreasoning imitation behaviour of C1 agents, who are 'cheated' by the well-paid C0 agents inhabiting special positions, stabilizes the formation of the cooperation community. The analytical and simulation results for certain parameters are found to coincide well with each other. The C0C1D case provides a picture of the actual behaviours in real society and thus is potentially of interest