SearcharxivSearch

arXiv · nlin/0307027

The Phase Structure in the Evolution of Globally coupled Spatial Prisoner's Dilemma

Abstract

We propose two new evolutionary rules that is not mimic evolution of strategies based on the spatial Prisoner's Dilemma (PD). The former follows the selfish evolutionary rule and then the coexistence phase appears with weak phase transition with mutations. The second rule is that of globally coupled spatial PD where the strategy of an agent is taken so that the total payoff of the whole system increases. Then it is natulally suspected that all agents will become cooperators in general. We, however, find that situations is rather complerx. We find two critical points within the usual conditions in the parameters included the payoff matrix in the PD. Further as we break the condition without losing PD condition, we meet two more essential curitical points. We discuss the areas between these critical points in the parameter space and uncover the various properties by simulating on computer. We show that in some parameter regions, strange properties, that is, like chaotic behaveor appear and the coexistence between defectors and cooperators appears in the large parameter region. Thus we point out that usual non-essential condition among the parameters in the payoff matrix imposed on the PD privent from recovering rich structures in the evolutionally spatial PS.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Norihito Toyota, Shota Hayakawa. 2003-07-17. The Phase Structure in the Evolution of Globally coupled Spatial Prisoner's Dilemma. https://arxiv.org/abs/nlin/0307027

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Optical free space extreme learning machine for the implementation of emergent complex systems

Cellular automata conform a set of computational models which evolve with a reduced set of simple rules, yet still are able to show extremely complex emergent phenomena such as fractals and universal computation. Despite their apparent simplicity, they have shown great potential in simulating natural systems and solving challenging computational tasks such as classification and image generation. Instead of implementing cellular automata purely at the software level, it is desirable to design novel analog computing platforms that physically evolve following the automata's underlying rules, thereby reducing power requirements and latency. Here, we introduce an optical extreme learning machine for the simulation of a wide range of cellular automata. Our system operates in free space, and uses a spatial light modulator to encode the evolution rules of the system, while coherent wave propagation performs the corresponding computations. Our results demonstrate a simple, fully-programmable, cost and power efficient, and easy to build and align platform for the implementation of a wide range of complex computational systems such as elementary cellular automata, Conway's Game of Life, and two-dimensional Turing machines.

nlin.CG

The istr-graph: Interactive Visualisation of any Classic-Graph in DDLab

Any type of attractor basin (classic-graph) created in DDLab can now be visualised, manipulated, and deconstructed as a drag/drop ``interactive state transition graph'' (istr-graph). The new istr-graph applies to subtrees, single basins, the basin of attraction field, compression, and all other classic-graph parameters. This is an important update on the pre-existing ``interactive basin of attraction field graph'' (ibaf-graph) specific to just the complete uncompressed field, but the ibaf-graph is nevertheless retained for some of its unique attributes. These issues are discussed with a focus on the scope and implementation of the new istr-graph.

nlin.CG

Game of Life on Archimedean Lattices: Glider Guns and Phase Dynamics

I explore Conway's Game of Life (GoL) on six composite Archimedean lattices. On the Kagome lattice, on which small gliders and puffers appear particularly frequently across inputs, I use the output of a symmetry-constrained evolutionary search algorithm to construct a novel glider gun. The glider gun comprises four interacting bouncers and stably emits a small glider every 276th generation. Serving as an extension of classical GoL, I also propose cells with a phase degree of freedom and an associated local phase rule, which on the Kagome lattice is demonstrated to host phase-periodic gliders. This enables the possibility of phase-sensitive and interference-based computations.

nlin.CG