English
Related papers

Related papers: A differential game with a blind player

200 papers

This paper deals with N-person nonzero-sum discrete-time Markov games under a probability criterion, in which the transition probabilities and reward functions are allowed to vary with time. Differing from the existing works on the expected…

Probability · Mathematics 2025-05-16 Xin Guo , Xin Wen

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…

Optimization and Control · Mathematics 2021-12-02 Bruno Ziliotto

We study the value and the optimal strategies for a two-player zero-sum optimal stopping game with incomplete and asymmetric information. In our Bayesian set-up, the drift of the underlying diffusion process is unknown to one player…

Probability · Mathematics 2020-07-15 Tiziano De Angelis , Erik Ekström , Kristoffer Glover

We consider a game, in which the dynamics is described by a non-linear Volterra integral equation of Hammerstein type with a weakly-singular kernel and the goals of the first and second players are, respectively, to minimize and maximize a…

Optimization and Control · Mathematics 2024-04-17 Mikhail I. Gomoyunov

In this paper, we investigate a partially observable zero sum games where the state process is a discrete time Markov chain. We consider a general utility function in the optimization criterion. We show the existence of value for both…

Optimization and Control · Mathematics 2022-11-16 Arnab Bhabak , Subhamay saha

We study the infinite horizon discrete time N-player nonzero-sum Dynkin game ($N \geq 2$) with stopping times as strategies (or pure strategies). We prove existence of an $\varepsilon$-Nash equilibrium point for the game by presenting a…

Optimization and Control · Mathematics 2022-03-10 Said Hamadène , Mohammed Hassani , Marie-Amélie Morlais

We characterize the critical parameter of oriented percolation on $\mathbb{Z}^2$ through the value of a zero-sum game. Specifically, we define a zero-sum game on a percolation configuration of $\mathbb{Z}^2$, where two players move a token…

Probability · Mathematics 2024-08-27 Avelio Sepúlveda , Bruno Ziliotto

A Dynkin game is a zero-sum, stochastic stopping game between two players where either player can stop the game at any time for an observable payoff. Typically the payoff process of the max-player is assumed to be smaller than the payoff…

Probability · Mathematics 2020-08-18 Ivan Guo

We introduce a discrete-time search game, in which two players compete to find an object first. The object moves according to a time-varying Markov chain on finitely many states. The players know the Markov chain and the initial probability…

Computer Science and Game Theory · Computer Science 2020-08-28 Benoit Duvocelle , János Flesch , Mathias Staudigl , Dries Vermeulen

We consider 2-player stochastic games with perfectly observed actions, and study the limit, as the discount factor goes to one, of the equilibrium payoffs set. In the usual setup where current states are observed by the players, we show…

Optimization and Control · Mathematics 2014-12-11 Jérôme Renault , Bruno Ziliotto

This paper analyses a stochastic differential game of control and stopping in which one of the players modifies a diffusion process using impulse controls, an adversary then chooses a stopping time to end the game. The paper firstly…

Optimization and Control · Mathematics 2019-10-04 David Mguni

The paper studies one-shot two-player games with non-Bayesian uncertainty. The players have an attitude that ranges from optimism to pessimism in the face of uncertainty. Given the attitudes, each player forms a belief about the set of…

Computer Science and Game Theory · Computer Science 2015-03-13 Jiwoong Lee , Jean Walrand

Recently, Press and Dyson have proposed a new class of probabilistic and conditional strategies for the two-player iterated Prisoner's Dilemma, so-called zero-determinant strategies. A player adopting zero-determinant strategies is able to…

Computer Science and Game Theory · Computer Science 2014-02-17 Liming Pan , Dong Hao , Zhihai Rong , Tao Zhou

We prove that in a general zero-sum repeated game where the first player is more informed than the second player and controls the evolution of information on the state, the uniform value exists. This result extends previous results on…

Optimization and Control · Mathematics 2013-01-10 Fabien Gensbittel , Miquel Oliu-Barton , Xavier Venel

This paper presents a learning dynamic with almost sure convergence guarantee for any stochastic game with turn-based controllers (on state transitions) as long as stage-payoffs induce a zero-sum or identical-interest game. Stage-payoffs…

Computer Science and Game Theory · Computer Science 2023-10-11 Muhammed O. Sayin

In \emph{zero-sum two-player hidden stochastic games}, players observe partial information about the state. We address: $(i)$ the existence of the \emph{uniform value}, i.e., a limiting average payoff that both players can guarantee for…

Optimization and Control · Mathematics 2026-02-09 Krishnendu Chatterjee , David Lurie , Raimundo Saona , Bruno Ziliotto

We examine the problem of the existence of optimal deterministic stationary strategiesintwo-players antagonistic (zero-sum) perfect information stochastic games with finitely many states and actions.We show that the existenceof such…

Computer Science and Game Theory · Computer Science 2016-11-28 Hugo Gimbert , Wieslaw Zielonka

We study a class of second order variational inequalities with bilateral constraints. Under certain conditions we show the existence of a unique viscosity solution of these variational inequalities and give a stochastic representation to…

Analysis of PDEs · Mathematics 2007-05-23 Mrinal K Ghosh , K S Mallikarjuna Rao

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…

Numerical Analysis · Mathematics 2021-03-26 Ľubomír Baňas , Giorgio Ferrari , Tsiry A. Randrianasolo

In a two-player zero-sum graph game the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In {\em bidding…

Theoretical Economics · Economics 2020-12-22 Guy Avni , Ismaël Jecker , Đorđe Žikelić