Related papers: Spatial Iterated Prisoner's Dilemma as a Transform…
This paper examines the integration of computational complexity into game theoretic models. The example focused on is the Prisoner's Dilemma, repeated for a finite length of time. We show that a minimal bound on the players' computational…
An evolutionary prisoner's dilemma (PD) game is studied with players located on a hierarchical structure of layered square lattices. The players can follow two strategies [D (defector) and C (cooperator)] and their income comes from PD…
Self-serving, rational agents sometimes cooperate to their mutual benefit. The two-player iterated prisoner's dilemma game is a model for including the emergence of cooperation. It is generally believed that there is no simple ultimatum…
A simple model for cooperation between "selfish" agents, which play an extended version of the Prisoner's Dilemma(PD) game, in which they use arbitrary payoffs, is presented and studied. A continuous variable, representing the probability…
This paper addresses a mathematically tractable model of the Prisoner's Dilemma using the framework of active inference. In this work, we design pairs of Bayesian agents that are tracking the joint game state of their and their opponent's…
Introducing strategy complexity into the basic conflict of cooperation and defection is a natural response to avoid the tragedy of the common state. As an intermediate approach, quasi-cooperators were recently suggested to address the…
We present an extensive, systematic study of the Prisoner's Dilemma and Snowdrift games on a square lattice under a synchronous, noiseless imitation dynamics. We show that for both the occupancy of the network and the (random) mobility of…
We study a spatial two-strategy (cooperation and defection) Prisoner's Dilemma game with two types ($A$ and $B$) of players located on the sites of a square lattice. The evolution of strategy distribution is governed by iterated strategy…
In spatial games players typically alter their strategy by imitating the most successful or one randomly selected neighbor. Since a single neighbor is taken as reference, the information stemming from other neighbors is neglected, which…
This paper studies scenarios of cyclic dominance in a coevolutionary spatial model in which game strategies and links between agents adaptively evolve over time. The Optional Prisoner's Dilemma (OPD) game is employed. The OPD is an extended…
The 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,…
Multi-agent reinforcement learning has received significant interest in recent years notably due to the advancements made in deep reinforcement learning which have allowed for the developments of new architectures and learning algorithms.…
Evolutionary Prisoner's Dilemma games with quenched inhomogeneities in the spatial dynamical rules are considered. The players following one of the two pure strategies (cooperation or defection) are distributed on a two-dimensional lattice.…
The iterated prisoner's dilemma is a game that produces many counter-intuitive and complex behaviors in a social environment, based on very simple basic rules. It illustrates that cooperation can be a good thing even in a competitive world,…
In this paper, the Optional Prisoner's Dilemma game in a spatial environment, with coevolutionary rules for both the strategy and network links between agents, is studied. Using a Monte Carlo simulation approach, a number of experiments are…
The recent discovery of zero-determinant strategies for the iterated Prisoner's Dilemma sparked a surge of interest in the surprising fact that a player can exert unilateral control over iterated interactions. These remarkable strategies,…
Matrix games like Prisoner's Dilemma have guided research on social dilemmas for decades. However, they necessarily treat the choice to cooperate or defect as an atomic action. In real-world social dilemmas these choices are temporally…
A cellular automaton in which cells represent agents playing the Prisoner's Dilemma (PD) game following the simple "win-stay, loose-shift" strategy is studied. Individuals with binary behavior, such as they can either cooperate (C) or…
The Prisoner's Dilemma Process on a graph $G$ is an iterative process where each vertex, with a fixed strategy (cooperate or defect), plays the game with each of its neighbours. At the end of a round each vertex may change its strategy to…
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…