Related papers: A two player zerosum game where only one player ob…

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…

This paper studies two-player zero-sum stochastic Bayesian games where each player has its own dynamic state that is unknown to the other player. Using typical techniques, we provide the recursive formulas and sufficient statistics in both…

We study two classes of zero-sum stochastic games with compact action sets and a finite product state space. These two classes assume a communication property on the state spaces of the players. For strongly communicating on one side games,…

Combinatorial game theory (CGT), as introduced by Berlekamp, Conway and Guy, involves two players who move alternately in a perfect information, zero-sum game, and there are no chance devices. Also the games have the finite descent property…

In a zero-sum stochastic game with signals, at each stage, two adversary players take decisions and receive a stage payoff determined by these decisions and a variable called state. The state follows a Markov chain, that is controlled by…

A double auction game with an infinite number of buyers and sellers is introduced. All sellers posses one unit of a good, all buyers desire to buy one unit. Each seller and each buyer has a private valuation of the good. The distribution of…

We introduce a zero-sum game problem of mean-field type as an extension of the classical zero-sum Dynkin game problem to the case where the payoff processes might depend on the value of the game and its probability law. We establish…

This paper proposes a game-theoretic approach to address the problem of optimal sensor placement against an adversary in uncertain networked control systems. The problem is formulated as a zero-sum game with two players, namely a malicious…

We consider a convexity constrained Hamilton-Jacobi-Bellman-type obstacle problem for the value function of a zero-sum differential game with asymmetric information. We propose a convexity-preserving probabilistic numerical scheme for the…

A zero-sum differential game with controlled jump-diffusion driven state is considered, and studied using a combination of dynamic programming and viscosity solution techniques. We prove, under certain conditions, that the value of the game…

This work focuses on the rate of convergence for singular perturbation problems for first-order Hamilton-Jacobi equations. As an application we derive the rate of convergence for singularly perturbed two-players zero-sum deterministic…

We consider concurrent mean-payoff games, a very well-studied class of two-player (player 1 vs player 2) zero-sum games on finite-state graphs where every transition is assigned a reward between 0 and 1, and the payoff function is the…

We investigate an infinite dimensional partial differential equation of Isaacs' type, which arises from a zero-sum differential game between two masses. The evolution of the two masses is described by a controlled transport/continuity…

We investigate a linear quadratic stochastic zero-sum game where two players lobby a political representative to invest in a wind turbine farm. Players are time-inconsistent because they discount performance with a non-constant rate. Our…

A two-player one-round binary game consists of two cooperative players who each replies by one bit to a message that he receives privately; they win the game if both questions and answers satisfy some predetermined property. A game is…

Probabilistic timed automata are a suitable formalism to model systems with real-time, nondeterministic and probabilistic behaviour. We study two-player zero-sum games on such automata where the objective of the game is specified as the…

Using methods from the statistical mechanics of disordered systems we analyze the properties of bimatrix games with random payoffs in the limit where the number of pure strategies of each player tends to infinity. We analytically calculate…

We consider the problem of two-player zero-sum games. This problem is formulated as a min-max Markov game in the literature. The solution of this game, which is the min-max payoff, starting from a given state is called the min-max value of…

Richman games are zero-sum games, where in each turn players bid in order to determine who will play next [Lazarus et al.'99]. We extend the theory to impartial general-sum two player games called \emph{bidding games}, showing the existence…

This paper examines finite zero-sum stochastic games and demonstrates that when the game's duration is sufficiently long, there exists a pair of approximately optimal strategies such that the expected average payoff at any point in the game…