Related papers: Press-Dyson Analysis of Asynchronous, Sequential P…
We study environments in which agents are randomly matched to play a Prisoner's Dilemma, and each player observes a few of the partner's past actions against previous opponents. We depart from the existing related literature by allowing a…
Zero-determinant (ZD) strategies, a recently found novel class of strategies in repeated games, has attracted much attention in evolutionary game theory. A ZD strategy unilaterally enforces a linear relation between average payoffs of…
Two-player zero-sum repeated games are well understood. Computing the value of such a game is straightforward. Additionally, if the payoffs are dependent on a random state of the game known to one, both, or neither of the players, the…
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 Prisoner's Dilemma (PD) game is used in several fields due to the emergence of cooperation among selfish players. Here, we have considered a one-dimensional lattice, where each cell represents a player, that can cooperate or defect.…
We study zero-sum differential games with state constraints and one-sided information, where the informed player (Player 1) has a categorical payoff type unknown to the uninformed player (Player 2). The goal of Player 1 is to minimize his…
We present insights and empirical results from an extensive numerical study of the evolutionary dynamics of the iterated prisoner's dilemma. Fixation probabilities for Moran processes are obtained for all pairs of 164 different strategies…
So far, the theory of equilibrium selection in the infinitely repeated prisoner's dilemma is insensitive to communication possibilities. To address this issue, we incorporate the assumption that communication reduces -- but does not…
We study two-player security games which can be viewed as sequences of nonzero-sum matrix games played by an Attacker and a Defender. The evolution of the game is based on a stochastic fictitious play process. Players do not have access to…
The field of Game Theory provides a useful mechanism for modeling many decision-making scenarios. In participating in these scenarios individuals and groups adopt particular strategies, which generally perform with varying levels of…
This paper studies the mechanisms, implications, and potential applications of the recently discovered class of Zero Determinant (ZD) strategies in iterated 2x2 games. These strategies were reported to successfully extort pure economic…
The prisoner's dilemma game is the most known contribution of game theory into social sciences. Here we describe new implications of this game for transactional and transformative leadership. While the autocratic (Stackelberg's) leadership…
We present tournament results and several powerful strategies for the Iterated Prisoner's Dilemma created using reinforcement learning techniques (evolutionary and particle swarm algorithms). These strategies are trained to perform well…
The observed cooperation on the level of genes, cells, tissues, and individuals has been the object of intense study by evolutionary biologists, mainly because cooperation often flourishes in biological systems in apparent contradiction to…
In a single-state repeated game, zero-determinant strategies can unilaterally force functions of the payoffs to take values in particular closed intervals. When the explicit use of a determinant is absent from the analysis, they are instead…
We investigate the win-lose relations between strategies of iterated prisoner's dilemma games by using a directed network concept to display the replicator dynamics results. In the giant strongly-connected component of the win/lose network,…
In this note, we present a compatibility test based on John Nash's game-theoretic notion of equilibrium strategy. The test must be taken separately by both partners, making it difficult for either partner alone to control the outcome. The…
Artificial intelligence and robotic competitions are accompanied by a class of game paradigms in which each player privately commits a strategy to a game system which simulates the game using the collected joint strategy and then returns…
Pursuit and evasion conflicts represent challenging problems with important applications in aerospace and robotics. In pursuit-evasion problems, synthesis of intelligent actions must consider the adversary's potential strategies.…
A simplified prisoner's game is studied on a square lattice when the players interacting with their neighbors can follow only two strategies: to cooperate (C) or to defect (D) unconditionally. The players updated in a random sequence have a…