Towards effective payoffs in the prisoner’s dilemma game on scale-free networks

By Attila Szolnoki, Matjaz Perc, Z. Danku. 2007

296 citations recorded by the source corpus.

We study the transition towards effective payoffs in the prisoner’s dilemma game on scale-free networks by introducing a normalization parameter guiding the system from accumulated payoffs to payoffs normalized with the connectivity of each agent. We show that during this transition the heterogeneity-based ability of scale-free networks to facilitate cooperative behavior deteriorates continuously, eventually collapsing with the results obtained on regular graphs. The strategy donations and adaptation probabilities of agents with different connectivities are studied. Results reveal that strategies generally spread from agents with larger towards agents with smaller degree. However, this strategy adoption flow reverses sharply in the fully normalized payoff limit. Surprisingly, cooperators occupy the hubs even if the averaged cooperation level due to partly normalized payoffs is moderate.

Subfields: Genetics, Sociology and Political Science, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/03db89e2f355059b08a9babcb08a208998f06b1d

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Genetics

  1. Matjaz Perc
  2. Sebastian Weber
  3. Jesús Gómez-Gardeñes
  4. Luis Mario Floría
  5. Long Wang
  6. Xiaojie Chen
  7. Lin Zhang
  8. Yongkui Liu

In Sociology and Political Science

  1. Matjaz Perc
  2. Jesús Gómez-Gardeñes
  3. Sebastian Weber
  4. Long Wang
  5. Luis Mario Floría
  6. Xiaojie Chen
  7. Lin Zhang
  8. Yongkui Liu

In Statistical and Nonlinear Physics

  1. Matjaz Perc
  2. Sebastian Weber
  3. Alex Arenas
  4. Celso Grebogi
  5. Wenxu Wang
  6. Jesús Gómez-Gardeñes
  7. Ying-Cheng Lai
  8. Long Wang

Citations in the corpus