English
Related papers

Related papers: A differential game with a blind player

200 papers

We present a modified version of the two-player "tug-of-war" game introduced by Peres, Schramm, Sheffield, and Wilson. This new tug-of-war game is identical to the original except near the boundary of the domain $\partial \Omega$, but its…

Analysis of PDEs · Mathematics 2011-08-30 Scott N. Armstrong , Charles K. Smart

We consider infinite-state turn-based stochastic games of two players, Box and Diamond, who aim at maximizing and minimizing the expected total reward accumulated along a run, respectively. Since the total accumulated reward is unbounded,…

Computer Science and Game Theory · Computer Science 2012-08-09 Tomáš Brázdil , Antonín Kučera , Petr Novotný

We consider two-player zero-sum differential games (ZSDGs), where the state process (dynamical system) depends on the random initial condition and the state process's distribution, and the objective functional includes the state process's…

Optimization and Control · Mathematics 2020-05-26 Jun Moon , Tamer Basar

In this paper we study a zero-sum switching game and its verification theorems expressed in terms of either a system of Reflected Backward Stochastic Differential Equations (RBSDEs in short) with bilateral interconnected obstacles or a…

Probability · Mathematics 2020-06-30 Said Hamadène , Tingshu Mu

This paper considers a two-person zero-sum continuous-time Markov pure jump game in Borel state and action spaces over a fixed finite horizon. The main assumption on the model is the existence of a drift function, which bounds the reward…

Optimization and Control · Mathematics 2017-03-31 Xin Guo , Yi Zhang

We prove two determinacy and decidability results about two-players stochastic reachability games with partial observation on both sides and finitely many states, signals and actions.

Computer Science and Game Theory · Computer Science 2008-11-26 Nathalie Bertrand , Blaise Genest , Hugo Gimbert

This paper investigates mixed strategies in dynamic games with perfect information. We present an example to show that a player may obtain higher payoff by playing mixed strategy. By contrast, the main result of the paper shows that every…

Optimization and Control · Mathematics 2020-01-01 Enxian Chen , Wei He , Yeneng Sun , Hanping Xu

We study minimax (generalized) solutions of a Cauchy problem for a (first-order) path-dependent Hamilton--Jacobi equation with co-invariant derivatives under a right-end boundary condition. Under assumptions on the Hamiltonian that are more…

Optimization and Control · Mathematics 2026-03-18 Mikhail Gomoyunov

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…

Optimization and Control · Mathematics 2024-12-02 Thomas Ragel , Bruno Ziliotto

The classical constant-sum 'silent duel' game had two antagonistic marksmen walking towards each other. A more friendly formulation has two equally skilled marksmen approaching targets at which they may silently fire at distances of their…

Computer Science and Game Theory · Computer Science 2017-12-04 Steve Alpern , J. V. Howard

We study in depth the class of games with opacity condition, which are two-player games with imperfect information in which one of the players only has imperfect information, and where the winning condition relies on the information he has…

Computer Science and Game Theory · Computer Science 2011-06-08 Bastien Maubert , Sophie Pinchinat , Laura Bozzelli

On a filtered probability space $(\Omega ,\mathcal{F}, (\mathcal{F}_t)_{t\in[0,\infty]}, \mathbb{P})$, we consider the two-player non-zero-sum stopping game $u^i := \mathbb{E}[U^i(\rho,\tau)],\ i=1,2$, where the first player choose a…

Optimization and Control · Mathematics 2015-08-18 Zhou Zhou

We introduce a simple one-parameter game derived from a model describing the properties of a directed polymer in a random medium. At his turn, each of the two players picks a move among two alternatives in order to maximize his final score,…

Statistical Mechanics · Physics 2008-12-08 Clément Sire

Mertens [In Proceedings of the International Congress of Mathematicians (Berkeley, Calif., 1986) (1987) 1528-1577 Amer. Math. Soc.] proposed two general conjectures about repeated games: the first one is that, in any two-person zero-sum…

Optimization and Control · Mathematics 2016-03-16 Bruno Ziliotto

We analyze a coin-based game with two players where, before starting the game, each player selects a string of length $n$ comprised of coin tosses. They alternate turns, choosing the outcome of a coin toss according to specific rules. As a…

A finite-horizon zero-sum linear-quadratic differential game is considered. Its features are: (i) the control cost of the minimizing player in the game's cost functional is much smaller than the control cost of the maximizing player and the…

Optimization and Control · Mathematics 2026-04-29 Valery Y. Glizer , Vladimir Turetsky

In this paper we study zero-sum two-player stochastic differential games with the help of theory of Backward Stochastic Differential Equations (BSDEs). At the one hand we generalize the results of the pioneer work of Fleming and Souganidis…

Probability · Mathematics 2011-02-19 Rainer Buckdahn , Juan Li

Zero-sum mean payoff games can be studied by means of a nonlinear spectral problem. When the state space is finite, the latter consists in finding an eigenpair $(u,\lambda)$ solution of $T(u)=\lambda \mathbf{1} + u$ where $T:\mathbb{R}^n…

Optimization and Control · Mathematics 2016-11-17 Marianne Akian , Stéphane Gaubert , Antoine Hochart

We establish new results for path-dependent Hamilton-Jacobi equations with nonlinear monotone, and coercive operators on Hilbert space, which were initially studied in Bayraktar and Keller [J. Funct. Anal., 275 (8) (2018), pp. 2096-2161].…

Analysis of PDEs · Mathematics 2025-09-22 Erhan Bayraktar , Mikhail Gomoyunov , Christian Keller

We study two-player zero-sum repeated games with incomplete information on one side, where the payoff function is tail measurable (and not necessarily the long-run average payoff). We show that the maxmin value equals the concavification of…

Optimization and Control · Mathematics 2025-12-02 Gil Bar Castellon Koltun , Ehud Lehrer , Eilon Solan