Paper Info
Title
The Spatiotemporal Prisoner'S Dilemma
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 modal 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.
Year
DOI
Venue
2000
10.1142/S021812740000102X
INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS
Field
DocType
Volume
Asynchronous communication,Universal Turing machine,Computer science,Prisoner's dilemma,Artificial intelligence,Parameter space,Cellular neural network
Journal
10
Issue
ISSN
Citations 
7
0218-1274
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Laszlo Nemes18623.45
Leon O. Chua21860497.65