Related papers: Sneaky Angel and Devil Game

We propose an extension of Strategy Logic (SL), in which one can both reason about strategizing under imperfect information and about players' knowledge. One original aspect of our approach is that we do not force strategies to be uniform,…

Penney's game is a two player zero-sum game in which each player chooses a three-flip pattern of heads and tails and the winner is the player whose pattern occurs first in repeated tosses of a fair coin. Because the players choose…

Quantum resources may provide advantage over their classical counterparts. Theoretically, in certain tasks, this advantage can be very high. In this work, we construct such a task based on a game, mediated by Referee and played between…

We study a class of two-player repeated games with incomplete information and informational externalities. In these games, two states are chosen at the outset, and players get private information on the pair, before engaging in repeated…

We investigate further several properties of the minority game we have recently introduced. We explain the origin of the phase transition and give an analytical expression of $\sigma^2/N$ in the $N\ll2^M$ region. The ability of the players…

In this paper we study a variant of the Nuel game (a generalization of the duel) which is played in turns by $N$ players. In each turn a single player must fire at one of the other players and has a certain probability of hitting and…

In this paper, we study a game called ``Mafia,'' in which different players have different types of information, communication and functionality. The players communicate and function in a way that resembles some real-life situations. We…

Euclid is a well known two-player impartial combinatorial game. A position in Euclid is a pair of positive integers and the players move alternately by subtracting a positive integer multiple of one of the integers from the other integer…

Mirror games were invented by Garg and Schnieder (ITCS 2019). Alice and Bob take turns (with Alice playing first) in declaring numbers from the set {1,2, ...2n}. If a player picks a number that was previously played, that player loses and…

We consider multi-player graph games with partial-observation and parity objective. While the decision problem for three-player games with a coalition of the first and second players against the third player is undecidable, we present a…

We study the optimal use of information in Markov games with incomplete information on one side and two states. We provide a finite-stage algorithm for calculating the limit value as the gap between stages goes to 0, and an optimal strategy…

In the last few decades, numerous experiments have shown that humans do not always behave so as to maximize their material payoff. Cooperative behavior when non-cooperation is a dominant strategy (with respect to the material payoffs) is…

The $q$-round Renyi-Ulam pathological liar game with $k$ lies on the set $[n]:=\{1,...,n\}$ is a 2-player perfect information zero sum game. In each round Paul chooses a subset $A\subseteq [n]$ and Carole either assigns 1 lie to each…

Blackwell games are infinite games of imperfect information. The two players simultaneously make their moves, and are then informed of each other's moves. Payoff is determined by a Borel measurable function $f$ on the set of possible…

We partially modify the rules of the Minority Game (MG) by introducing some degree of local information in the game, which is only available for some agents, called the interacting agents. Our work shows that, for small values of the new…

Shmuel Gal and Jerome Casas have recently introduced a game theoretic model that combines search and pursuit by a predator for a prey animal. The prey (hider) can hide in a finite number of locations. The predator (searcher) can inspect any…

In the $(s,d)$-spy game over a graph, introduced by Cohen et al. in 2016, one spy and $k$ guards occupy vertices of a graph and, at each turn, each guard may move along one edge and the spy may move along at most $s$ edges. The guards win…

We report the first experimental demonstration of the odd-cycle game. We entangle two ions separated by ~2 m and the players use them to win the odd-cycle game with a probability ~26 sigma above that allowed by the best classical strategy.…

The dueling bandit problem, an essential variation of the traditional multi-armed bandit problem, has become significantly prominent recently due to its broad applications in online advertising, recommendation systems, information…

Stochastic two-player games model systems with an environment that is both adversarial and stochastic. The adversarial part of the environment is modeled by a player (Player 2) who tries to prevent the system (Player 1) from achieving its…