Spatial Iterated Prisoner's Dilemma as a Transformation Semigroup

TL;DR

This paper models the spatial iterated Prisoner's Dilemma as a discrete dynamical system and analyzes its algebraic structure using Krohn-Rhodes automata theory, revealing how strategy dynamics depend on game parameters.

Contribution

It introduces an algebraic automata-theoretic framework to analyze the spatial iterated PD, uncovering structural differences based on payoff parameters.

Findings

Algebraic structures emerge in certain parameter regimes.

Number of group levels varies with temptation to defect.

Reversibility pools increase at intermediate temptation levels.

Abstract

The prisoner's dilemma (PD) is a game-theoretic model studied in a wide array of fields to understand the emergence of cooperation between rational self-interested agents. In this work, we formulate a spatial iterated PD as a discrete-event dynamical system where agents play the game in each time-step and analyse it algebraically using Krohn-Rhodes algebraic automata theory using a computational implementation of the holonomy decomposition of transformation semigroups. In each iteration all players adopt the most profitable strategy in their immediate neighbourhood. Perturbations resetting the strategy of a given player provide additional generating events for the dynamics. Our initial study shows that the algebraic structure, including how natural subsystems comprising permutation groups acting on the spatial distributions of strategies, arise in certain parameter regimes for the pay-off matrix, and are absent for other parameter regimes. Differences in the number of group levels in the holonomy decomposition (an upper bound for Krohn-Rhodes complexity) are revealed as more pools of reversibility appear when the temptation to defect is at an intermediate level. Algebraic structure uncovered by this analysis can be interpreted to shed light on the dynamics of the spatial iterated PD.