Related papers: A Theoretical Study of Mafia Games
In this paper we study the cooperative behavior of agents playing the Prisoner's Dilemma game in random scale-free networks. We show that the survival of cooperation is enhanced with respect to random homogeneous graphs but, on the other…
We consider bandit problems involving a large (possibly infinite) collection of arms, in which the expected reward of each arm is a linear function of an $r$-dimensional random vector $\mathbf{Z} \in \mathbb{R}^r$, where $r \geq 2$. The…
In this work we present a pedagogical introduction to the minority game and various new versions of it with interesting properties, focusing in its applications in socialphysics. For instance, some systems display a kind of social behavior…
In this paper, we introduce malicious Bayesian congestion games as an extension to congestion games where players might act in a malicious way. In such a game each player has two types. Either the player is a rational player seeking to…
We consider a game-theoretic setting to model the interplay between attacker and defender in the context of information flow, and to reason about their optimal strategies. In contrast with standard game theory, in our games the utility of a…
Prisoner's Dilemma is a game theory model used to describe altruistic behavior seen in various populations. This theoretical game is important in understanding why a seemingly selfish strategy does persist and spread throughout a population…
The classical, complete-information two-player games assume that the problem data (in particular the payoff matrix) is known exactly by both players. In a now famous result, Nash has shown that any such game has an equilibrium in mixed…
We study a game where one player selects a random function, and the other has to guess that function, and show that with high probability the second player can correctly guess most of the random function. We apply this analysis to…
Parrondo's paradox arises in sequences of games in which a winning expectation may be obtained by playing the games in a random order, even though each game in the sequence may be lost when played individually. We present a suitable version…
The aim of this of this paper is to study infinite games and to prove formally some properties in this framework. As a consequence we show that the behavior (the madness) of people which leads to speculative crashes or escalation can be…
We study evolutionary game dynamics in a well-mixed populations of finite size, N. A well-mixed population means that any two individuals are equally likely to interact. In particular we consider the average abundances of two strategies, A…
Every interaction of a living organism with its environment involves the placement of a bet. Armed with partial knowledge about a stochastic world, the organism must decide its next step or near-term strategy, an act that implicitly or…
Extensive-form games are a common model for multiagent interactions with imperfect information. In two-player zero-sum games, the typical solution concept is a Nash equilibrium over the unconstrained strategy set for each player. In many…
It is well known that in games with imperfect information, such as poker, bluffing with some probability can be a component of the optimal strategy. However, as far as we know, nobody has ever exhibited a Scrabble position in which the…
Can a probabilistic gambler get arbitrarily rich when all deterministic gamblers fail? We study this problem in the context of algorithmic randomness, introducing a new notion -- almost everywhere computable randomness. A binary sequence…
We consider a stochastic version of the well-known Blotto game, called the gladiator game. In this zero-sum allocation game two teams of gladiators engage in a sequence of one-to-one fights in which the probability of winning is a function…
n infinite two-player zero-sum game with a Borel winning set, in which the opponent's actions are monitored eventually but not necessarily immediately after they are played, is determined. The proof relies on a representation of the game as…
We study an ensemble of individuals playing the two games of the so-called Parrondo paradox. In our study, players are allowed to choose the game to be played by the whole ensemble in each turn. The choice cannot conform to the preferences…
Congestion games model a wide variety of real-world resource congestion problems, such as selfish network routing, traffic route guidance in congested areas, taxi fleet optimization and crowd movement in busy areas. However, existing…
Concurrent games with a fixed number of agents have been thoroughly studied, with various solution concepts and objectives for the agents. In this paper, we consider concurrent games with an arbitrary number of agents, and study the problem…