Evolution of prisonerʹs dilemma strategies on scale-free networks

The evolution of strategies in the iterated prisonerʹs dilemma on scale-free networks is investigated. It is found that the smaller the average degree is, the easier it is to promote cooperation by natural selection. Cooperation on scale-free networks built upon big clustering coefficients is enhanced and maintained at a high level. The introduction of punishment strategy for unsatisfied agents also increases cooperation and improves its persistence on scale-free networks.