Source-linked AI summary
Towards effective payoffs in the prisoner's dilemma game on scale-free networks
Attila Szolnoki, Matjaz Perc, Zsuzsa Danku
TL;DR
The paper asks how payoff normalization affects the cooperation-promoting role of scale-free networks. It introduces an interpolation parameter and analyzes strategy donations and adaptations across connectivities, finding continuously deteriorating cooperation support and a sharp reversal of strategy flow at full normalization.
Problem
The paper examines how the cooperation-promoting advantage of scale-free networks changes when payoffs are normalized by agent connectivity.
Method
The study introduces a normalization parameter interpolating between accumulated and connectivity-normalized payoffs, and measures strategy donation and adaptation probabilities across connectivities.
Results
Cooperation deteriorates continuously as α decreases toward 0, while strategies generally spread from larger- to smaller-degree agents and reverse direction sharply in the fully normalized limit.
Takeaways & Limitations
Cooperators can occupy the main hubs under partly normalized payoffs, but effective payoffs make those hubs comparatively mutable and unable to sustain cooperative spread.
Abstract
from arXiv · showhide
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.
1 Introduction
The paper frames cooperation as a challenge for evolutionary theory and focuses on how scale-free network topology promotes cooperation in the prisoner’s dilemma. It studies the transition from accumulated to connectivity-normalized payoffs and the associated strategy flows.
- Motivation: The prisoner’s dilemma models cooperation between selfish individuals, but the classical well-mixed version drives cooperators to extinction.Defectors receive the highest individual income against cooperators, although mutual cooperation yields greater combined income than mixed or mutual defection.
- Motivation: Spatial structure can protect cooperators through clustering, although spatial structure does not universally favor cooperation.
- Related work: Scale-free network topology is identified as a major factor determining evolutionary outcomes and as a potent promoter of cooperation.
- Contribution: The paper investigates how payoff normalization changes cooperation on scale-free networks, moving continuously between absolute and effective payoffs.It also introduces strategy donation and adaptation probabilities to identify microscopic sources and targets of strategy flow.
2 The Game
The model uses a two-strategy prisoner’s dilemma on a growing scale-free network, with agents accumulating payoffs before probabilistic strategy adoption. A normalization parameter interpolates between effective and absolute payoffs, while hub connectivity supports transient cooperative dominance.
- The Game: Agents play a two-strategy prisoner’s dilemma on a scale-free network generated by growth and preferential attachment.Vertices begin as cooperators or defectors with equal probability, and interactions are organized through network neighbors.
- The Game: Payoffs are accumulated from interactions using temptation b, reward 1, and punishment and sucker payoff 0, with 1 < b < 2.
- Payoff normalization: The normalization parameter α controls the transition from fully normalized effective payoffs at α = 0 to accumulated absolute payoffs at α = 1.Payoffs are normalized according to each player’s number of interactions before strategy adoption.
- Strategy update: A player adopts a neighbor’s strategy probabilistically when the neighbor’s payoff exceeds its own, using a denominator based on b and the larger connectivity.The adoption probability is constrained to lie between 0 and 1.
- Implementation: The asynchronous Monte Carlo procedure selects players randomly and updates each individual once on average per Monte Carlo step.Simulations use N = 5·10^3 to 5·10^4 agents with average connectivity z = 4.
- Cooperation mechanism: High hub connectivity gives hubs large cumulative payoffs, allowing their neighbors to imitate them and forming homogeneous strategy clouds around hubs.Over time, this process strengthens cooperative hubs and weakens defective hubs.
- Payoff normalization: Absolute payoffs preserve an additional network-based advantage for cooperators, whereas effective payoffs remove that advantage and motivate studying intermediate normalization.
3 Results
As payoff normalization increases toward the effective-payoff limit, cooperation declines continuously, but cooperators remain concentrated on hubs until α = 0. The underlying strategy flow changes because hubs become increasingly mutable and lose more often to defectors.
- Equilibrium cooperation: Cooperation declines continuously as α decreases from 1 toward 0, with effective payoffs nearly eliminating cooperation for b > 1.2.At α = 1, cooperation dominates across the full b range; α = 0 produces results similar to regular graphs, indicating loss of the scale-free network advantage.
- Hub occupation: χ = ρcl/ρC tracks whether cooperators occupy high-connectivity vertices, with χ > 1 indicating cooperative hubs.The ratio supplements the overall cooperation level in mixed states, where link-weighted and node-level cooperator fractions can differ.
- Hub occupation: Cooperative hubs remain occupied by cooperators almost until α = 0, despite the deterioration of average cooperation under normalization.The largest-connectivity class retains cooperation longest, while the medium-connectivity class deteriorates sooner.
- Strategy flow: For α = 1, medium- and high-connectivity agents are nearly frozen and spread strategies toward lower-connectivity agents; at α = 0, low-connectivity agents can donate strategies.The probabilities Pa(k) and Pd(k) characterize adaptation targets and donation sources, respectively.
- Strategy flow: As α approaches 0, hubs change strategy more often, shifting adaptation activity away from the larger-connectivity agents seen at higher α.This increased hub mutability, rather than failure to occupy hubs, prevents cooperators from sustaining hub positions and spreading cooperation.
4 Summary
The paper examines how a normalization parameter α changes cooperation on scale-free networks. Effective payoffs undermine cooperation through unstable hub occupancy and reverse strategy-transmission patterns, while cooperators still prefer hubs across payoff efficiencies.
- The study introduces α to guide payoffs continuously from accumulated to connectivity-normalized forms in the prisoner’s dilemma on scale-free networks.
- Cooperation is progressively damaged as payoffs become more effective, primarily because cooperators cannot permanently retain hubs against defective intruders.
- Under normalized payoffs, agents with the smallest connectivity govern evolution, and strategy transmission reverses direction relative to the usual flow.
- Cooperators preferentially occupy widely connected nodes regardless of payoff efficiency, revealing heterogeneous strategy placement across the scale-free network.