Abstract
We investigate a system of interacting agents which play 3-person Prisoner's Dilemma game on a regular 2-dimensional lattice. The agents can choose between All-D, A11-C, and TFT strategies. The peculiar structure of 3-person interactions gives rise to two different TFT strategies, which have different influence on the temporal evolution of the system. We introduce a formal setting for the relevant cellular automaton with the 3-person interactions, compare different TFT strategies, and discuss various properties of the 3-person games on the lattice. © Springer-Verlag 2004.
Cite
CITATION STYLE
Gulyás, L., & Płatkowski, T. (2004). On evolutionary 3-person prisoner’s dilemma games on 2-D lattice. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3305, 831–840. https://doi.org/10.1007/978-3-540-30479-1_86
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
