Cooperation in the snowdrift game on directed small-world networks under self-questioning and noisy conditions

Cooperation in the evolutionary snowdrift game with a self-questioning updating mechanism is studied on annealed and quenched small-world networks with directed couplings. Around the payoff parameter value $r=0.5$, we find a size-invariant symmetrical cooperation effect. While generally suppressing cooperation for $r>0.5$ payoffs, rewired networks facilitated cooperative behavior for $r<0.5$. Fair amounts of noise were found to break the observed symmetry and further weaken cooperation at relatively large values of $r$. However, in the absence of noise, the self-questioning mechanism recovers symmetrical behavior and elevates altruism even under large-reward conditions. Our results suggest that an updating mechanism of this type is necessary to stabilize cooperation in a spatially structured environment which is otherwise detrimental to cooperative behavior, especially at high cost-to-benefit ratios. Additionally, we employ component and local stability analyses to better understand the nature of the manifested dynamics.

💡 Research Summary

This paper investigates the evolution of cooperation in the snowdrift game (also known as the Hawk‑Dove or Chicken game) when agents update their strategies using a “self‑questioning” rule on directed small‑world networks. Two types of network dynamics are considered: annealed (the network is rewired at every update step) and quenched (the network topology is fixed after an initial construction). The underlying graph is generated by a Watts‑Strogatz procedure with a fixed average degree k, but each link is assigned a direction, thereby breaking the symmetry of influence between neighbors.

In the self‑questioning mechanism each player evaluates the expected payoff of its current strategy and that of the opposite strategy by averaging over the strategies of its incoming neighbors, weighted by the direction of the links. If the alternative strategy yields a higher expected payoff the player adopts it with probability 1 − ε; with probability ε a random error (noise) forces a sub‑optimal switch. When ε = 0 the rule reduces to a deterministic best‑response based on one’s own “question”.

The payoff matrix of the snowdrift game is parameterised by the cost‑to‑benefit ratio r = c/(2b − c), ranging from 0 (cooperation is cheap) to 1 (cooperation is very costly). Extensive Monte‑Carlo simulations are performed for system sizes up to N = 10⁴, average degree k = 4, rewiring probabilities p∈