The spatiotemporal prisoner's dilemma

László Nemes, Leon O. Chua

Research output: Contribution to journalArticle

Abstract

A novel platform, the cellular neural network universal machine (CNN-UM) model is proposed to simulate the spatial prisoner's dilemma (SPD) game introduced in [Nowak & May, 1992]. The application of CNN is motivated by both its high conformity with the modeled natural phenomena (analog dynamics) and its superior speed enabling the exploration of the SPD's vast parameter space. Several models are shown as examples of CNN implementation. In particular, a synchronously updated model is introduced using strategy based on best individual strategy (BIS). A new synchronous model is shown based on better average strategy (BAS). Stemming from the CNN implementation of synchronous SPD an asynchronous model has been developed employing BIS, and the survival of clusters of cooperating individuals is demonstrated. This seems to contradict the view elaborated in [Huberman & Glance 1993] claiming that the viability of cooperation is an artifact of synchronous updating in SPD.

Original languageEnglish
Pages (from-to)1623-1644
Number of pages22
JournalInternational Journal of Bifurcation and Chaos in Applied Sciences and Engineering
Volume10
Issue number7
DOIs
Publication statusPublished - Jul 2000

ASJC Scopus subject areas

  • Modelling and Simulation
  • Engineering (miscellaneous)
  • General
  • Applied Mathematics

Fingerprint Dive into the research topics of 'The spatiotemporal prisoner's dilemma'. Together they form a unique fingerprint.

  • Cite this