Related papers: Playing Muller Games in a Hurry
In a mean field game of controls, a large population of identical players seek to minimize a cost that depends on the joint distribution of the states of the players and their controls. We first consider the classes of mean field games of…
The voting process is formalized as a multistage voting model with successive alternative elimination. A finite number of agents vote for one of the alternatives each round subject to their preferences. If the number of votes given to the…
Parity games are two-player infinite-duration games on graphs that play a crucial role in various fields of theoretical computer science. Finding efficient algorithms to solve these games in practice is widely acknowledged as a core problem…
The Banach-Mazur game, Schmidt's game and McMullen's absolute winning game are three quintessential intersection games. We investigate their determinacy on the real line when the target set for either player is a Bernstein set, a…
We consider 2-player zero-sum stochastic games where each player controls his own state variable living in a compact metric space. The terminology comes from gambling problems where the state of a player represents its wealth in a casino.…
We study the accumulation of deleterious mutations in a haploid, asexually reproducing population, using analytical models and computer simulations. We find that Muller's ratchet can come to a halt in small populations as a consequence of a…
We prove that every repeated game with countably many players, finite action sets, and tail-measurable payoffs admits an $\epsilon$-equilibrium, for every $\epsilon > 0$.
The aim of this note is to investigate the open-open game of uncountable length. We introduce a cardinal number $\mu(X)$, which says how long the Player I has to play to ensure a victory. It is proved that $\su(X)\leq\mu(X)\leq\su(X)^+$. We…
We prove an explicit upper bound on the amount of entanglement required by any strategy in a two-player cooperative game with classical questions and quantum answers. Specifically, we show that every strategy for a game with n-bit questions…
Quitting games are one of the simplest stochastic games in which at any stage each player has only two possible actions, continue and quit. The game ends as soon as at least one player chooses to quit. The players then receive a payoff,…
A multi-player competitive Dynkin stopping game is constructed. Each player can either exit the game for a fixed payoff, determined a priori, or stay and receive an adjusted payoff depending on the decision of other players. The single…
The primary objective of this paper is to understand first-order, time-dependent mean-field games with Neumann boundary conditions, a question that remains under-explored in the literature. This matter is particularly relevant given the…
We study the asymptotic organization among many optimizing individuals interacting in a suitable "moderate" way. We justify this limiting game by proving that its solution provides approximate Nash equilibria for large but finite player…
We introduce quantum XOR games, a model of two-player one-round games that extends the model of XOR games by allowing the referee's questions to the players to be quantum states. We give examples showing that quantum XOR games exhibit a…
We provide a criterion for determining the winner in two-player win-lose alternating-move games on trees, in terms of the Hausdorff dimension of the target set. We focus our study on special cases, including the Gale-Stewart game on the…
We analyze the Master Equation within Mean Field Games (MFG) theory considering a bounded domain with homogeneous Dirichlet conditions. Concerning the N-players differential game, the player's dynamic ends when touching the boundary. We…
We show that the winning positions of a certain type of two-player game form interesting patterns which often defy analysis, yet can be computed by a cellular automaton. The game, known as {\em Blocking Wythoff Nim}, consists of moving a…
We consider strong law of large numbers (SLLN) in the framework of game-theoretic probability of Shafer and Vovk (2001). We prove several versions of SLLN for the case that Reality's moves are unbounded. Our game-theoretic versions of SLLN…
We consider 2-player games played on a finite state space for infinite rounds. The games are concurrent: in each round, the two players choose their moves simultaneously; the current state and the moves determine the successor. We consider…
A game starts with the empty graph on $n$ vertices, and two player alternate adding edges to the graph. Only moves which do not create a triangle are valid. The game ends when a maximal triangle-free graph is reached. The goal of one player…