A tag-mediated N-person Prisoner's Dilemma game on networks with different topologies

  • Authors:
  • Jae-Woo Kim

  • Affiliations:
  • University of California, Riverside, CA

  • Venue:
  • SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In tag-based Prisoner's Dilemma games, agents learn tolerance, copy traits from more successful neighbors, cooperate with in-group alters, and otherwise defect. Current research concludes that cooperation can emerge and be sustained, tolerance decreases, and agents become homogeneous. Such emergent societies are vulnerable to invasion by mutants with the same traits as those of cooperators but who defect. However, one question that has yet to be answered is whether these results can vary from one network structure to another. We investigate tag-based parochial cooperation not only on grid but also on local, small-world, and random network. We find that cooperation can be institutionalized at lower benefit-to-cost ratios than the average degree given tag-based identities, which would not otherwise happen. The average tolerance is positively influenced by the benefit-to-cost ratio, the number of identity dimensions, and heterogeneity. None of societies holds evolutionarily stable parochial cooperation since the selection pressure for homogenization is strong in a small population. Nonetheless, there are distinctive patterns in the emergence of cooperation, its diffusion, and invasion by mutants across societies. We propose future directions discussing how persistent heterogeneity and the dynamics of clustering and bridging are critical for the evolutionary stability of parochial cooperation in more tolerant societies.