An exhaustive exploration of the parameter space of the Prisoners' Dilemma in one-dimensional cellular automata

Simple item page
dc.creatorPereira, Marcelo Alves
dc.creatorMartinez, Alexandre Souto
dc.creatorEspindola, Aquino Lauri
dc.date2007-08-31
dc.date2008-03-13
dc.date.accessioned2026-07-07T09:26:18Z
dc.date.available2026-07-07T09:26:18Z
dc.descriptionThe Prisoner's Dilemma (PD) is one of the most popular games of the Game Theory due to the emergence of cooperation among competitive rational players. In this paper, we present the PD played in cells of one-dimension cellular automata, where the number of possible neighbors that each cell interacts, z, can vary. This makes possible to retrieve results obtained previously in regular lattices. Exhaustive exploration of the parameters space is presented. We show that the final state of the system is governed mainly by the number of neighbors z and there is a drastic difference if it is even or odd.
dc.description6 pages, 7 eps figures, published in the Brazilian Journal of Physics
dc.identifierhttps://arxiv.org/abs/0708.4253
dc.identifierhttp://arxiv.org/abs/0708.4253
dc.identifierBraz. J. Phys. vol. 38, no. 1 (2008) p. 65-69
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/156701
dc.subjectPhysics and Society
dc.subjectComputational Physics
dc.titleAn exhaustive exploration of the parameter space of the Prisoners' Dilemma in one-dimensional cellular automata
dc.typetext

Files

Collections

arXiv