Related papers: Prisoners, Rooms, and Lightswitches
We introduce the stochastic Network-Iterated Prisoner's Dilemma (NIPD) model, a network of players playing the Prisoner's Dilemma with their neighbours, each with a memory-one strategy which they constantly and locally update to improve…
The lowest temptation level (T = 1) is considered a trivial case for the Prisoner's Dilemma. Here, we show that this statement is true only for a very particular case, where the players interact with only one player. Otherwise, if the…
The spatial Prisoner's Dilemma is a prototype model to show the emergence of cooperation in very competitive environments. It considers players, at site of lattices, that can either cooperate or defect when playing the Prisoner's Dilemma…
We focus on the heterogeneity of social networks and its role to the emergence of prevailing cooperation and sustaining cooperators. The social networks are representative of the interaction relationships between players and their…
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…
We present a detailed study of prisoner's dilemma game with stochastic modifications on a two-dimensional lattice, in presence of evolutionary dynamics. By very nature of the rules, the cooperators have incentive to cheat and the fear to…
The Prisoner's Dilemma has been a subject of extensive research due to its importance in understanding the ever-present tension between individual self-interest and social benefit. A strictly dominant strategy in a Prisoner's Dilemma…
Stability of evolutionary dynamics of non-repeated Prisoner's Dilemma game with non-uniform interaction rates [1], via benefit and cost dilemma is studied . Moreover, the stability condition (b+c/b-c)2 < r1r3 is derived in case of…
Evolution of cooperation in the prisoner's dilemma game is studied where initially all players are linked via a regular graph, having four neighbors each. Simultaneously with the strategy evolution, players are allowed to make new…
In many social dilemmas, individuals tend to generate a situation with low payoffs instead of a system optimum ("tragedy of the commons"). Is the routing of traffic a similar problem? In order to address this question, we present…
We consider a generalization of the classical 100 Prisoner problem and its variant, involving empty boxes, whereby winning probabilities for a team depend on the number of attempts, as well as on the number of winners. We call this the…
Emergence of cooperation in self-centered individuals has been a major puzzle in the study of evolutionary ethics. Reciprocal altruism is one of explanations put forward and prisoner's dilemma has been a paradigm in this context. Emergence…
Changes in payoffs can transform Prisoner's Dilemma and other social dilemmas into harmonious win-win games. Using the Robinson-Goforth topology of 2x2 games, this paper analyzes how payoff swaps turn Prisoner's Dilemma into other games,…
Gallice and Monzon (2019) present a natural environment that sustains full cooperation in one-shot social dilemmas among a finite number of self-interested agents. They demonstrate that in a sequential public goods game, where agents lack…
This paper addresses a structural design problem in control systems, and explicitly takes into consideration the possible application to large-scale systems. More precisely, we aim to determine and characterize the minimum number of…
We introduce a novel concept of simple loop dwell time and use it to give sufficient conditions for stability of a continuous-time linear switched system where switching between subsystems is governed by an underlying graph. We present a…
Minimal input/output selection is investigated in this paper for each subsystem of a networked system. Some novel sufficient conditions are derived respectively for the controllability and observability of a networked system, as well as…
Let $S$ be a connected graph which contains an induced path of $n-1$ vertices, where $n$ is the order of $S.$ We consider a puzzle on $S$. A configuration of the puzzle is simply an $n$-dimensional column vector over $\{0, 1\}$ with…
We study the evolutionary dynamics of the prisoner's dilemma game in which cooperators and defectors interact with another actor type called exiters. Rather than being exploited by defectors, exiters exit the game in favour of a small…
We consider a variant of the game of Cops and Robbers, called Containment, in which cops move from edge to adjacent edge, the robber moves from vertex to adjacent vertex (but cannot move along an edge occupied by a cop). The cops win by…