Network-Iterated Prisoner's Dilemma

Abstract

We introduce the stochastic Network-Iterated Prisoner's Dilemma (NIPD) model, a network of players playing the Prisoner's Dilemma with their neighbours, each with a memory-one strategy which they constantly and locally update to improve their success. This process is non-deterministic, and mirrors societal interactions in many relevant aspects. We use it to assess the flexibility, noise tolerance and real-world adaptability of some well-known strategies. Furthermore, in the model a new strategy naturally emerges which proves way more successful than those. We also derive some theoretical parameters that gauge the success of a strategy in this context.