English
Related papers

Related papers: Two-player nonZero-sum stopping games in discrete …

200 papers

We prove that every two-player non-zero-sum Dynkin game in continuous time admits an epsilon-equilibrium in randomized stopping times. We provide a condition that ensures the existence of an epsilon-equilibrium in non-randomized stopping…

Probability · Mathematics 2010-09-29 Rida Laraki , Eilon Solan

We consider two-player non-zero-sum stopping games in discrete time. Unlike Dynkin games, in our games the payoff of each player is revealed after both players stop. Moreover, each player can adjust her own stopping strategy according to…

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

We study two-player zero-sum stopping games in continuous time and infinite horizon. We prove that the value in randomized stopping times exists as soon as the payoff processes are right-continuous. In particular, as opposed to existing…

Optimization and Control · Mathematics 2007-05-23 Rida Laraki , Eilon Solan

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

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 study a two-player nonzero-sum stochastic differential game where one player controls the state variable via additive impulses while the other player can stop the game at any time. The main goal of this work is characterize Nash…

Probability · Mathematics 2019-04-02 Luciano Campi , Davide De Santis

We study a model of two-player, zero-sum, stopping games with asymmetric information. We assume that the payoff depends on two continuous-time Markov chains (X, Y), where X is only observed by player 1 and Y only by player 2, implying that…

Optimization and Control · Mathematics 2017-12-06 Fabien Gensbittel , Christine Grün

We study a nonzero-sum game of two players which is a generalization of the antagonistic noisy duel of discrete type. The game is considered from the point of view of various criterions of optimality. We prove existence of…

Optimization and Control · Mathematics 2007-08-18 Lyubov N. Positselskaya

We show that every two-player stochastic game with finite state and action sets and bounded, Borel-measurable, and shift-invariant payoffs, admits an $\ep$-equilibrium for all $\varepsilon>0$.

Optimization and Control · Mathematics 2022-03-29 János Flesch , Eilon Solan

In this paper we establish a new connection between a class of 2-player nonzero-sum games of optimal stopping and certain $2$-player nonzero-sum games of singular control. We show that whenever a Nash equilibrium in the game of stopping is…

Optimization and Control · Mathematics 2017-12-29 Tiziano De Angelis , Giorgio Ferrari

We consider multi-player stopping games in continuous time. Unlike Dynkin games, in our games the payoff of each player is revealed after all the players stop. Moreover, each player can adjust her own stopping strategy by observing other…

Optimization and Control · Mathematics 2015-09-15 Zhou Zhou

It was shown in Flesch and Solan (2022) with a rather involved proof that all two-player stochastic games with finite state and action spaces and shift-invariant payoffs admit an $\epsilon$-equilibrium, for every $\epsilon>0$. Their proof…

Optimization and Control · Mathematics 2022-08-25 Galit Ashkenazi-Golan , János Flesch , Eilon Solan

In this paper we consider two-person zero-sum risk-sensitive stochastic dynamic games with Borel state and action spaces and bounded reward. The term risk-sensitive refers to the fact that instead of the usual risk neutral optimization…

Optimization and Control · Mathematics 2021-07-21 Nicole Bäuerle , Ulrich Rieder

We consider a general nonzero-sum impulse game with two players. The main mathematical contribution of the paper is a verification theorem which provides, under some regularity conditions, a suitable system of quasi-variational inequalities…

Probability · Mathematics 2018-11-09 René Aïd , Matteo Basei , Giorgia Callegaro , Luciano Campi , Tiziano Vargiolu

We prove that zero-sum Dynkin games in continuous time with partial and asymmetric information admit a value in randomised stopping times when the stopping payoffs of the players are general \cadlag measurable processes. As a by-product of…

Probability · Mathematics 2022-06-08 Tiziano De Angelis , Nikita Merkulov , Jan Palczewski

We introduce a new non-zero-sum game of optimal stopping with asymmetric exercise opportunities. Given a stochastic process modelling the value of an asset, one player observes and can act on the process continuously, while the other player…

Probability · Mathematics 2024-05-16 José Luis Pérez , Neofytos Rodosthenous , Kazutoshi Yamazaki

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 this paper we study the nonzero-sum Dynkin game in continuous time which is a two player non-cooperative game on stopping times. We show that it has a Nash equilibrium point for general stochastic processes. As an application, we…

Pricing of Securities · Quantitative Finance 2008-12-10 Said Hamadene , Jianfeng Zhang

We study a general formulation of the classical two-player Dynkin game in a discrete time Markovian setting. We identify an appropriate class of mixed strategies -- \textit{Markovian randomized stopping times} -- in which players stop at…

Probability · Mathematics 2025-08-13 Sören Christensen , Kristoffer Lindensjö , Berenice Anne Neumann

We suggest a new algorithm for two-person zero-sum undiscounted stochastic games focusing on stationary strategies. Given a positive real $\epsilon$, let us call a stochastic game $\epsilon$-ergodic, if its values from any two initial…

Computer Science and Game Theory · Computer Science 2015-08-17 Endre Boros , Khaled Elbassioni , Vladimir Gurvich , Kazuhisa Makino
‹ Prev 1 2 3 10 Next ›