English
Related papers

Related papers: Optimal stopping and a non-zero-sum Dynkin game in…

200 papers

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

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 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 analyze a two-player, nonzero-sum Dynkin game of stopping with incomplete information. We assume that each player observes his own Brownian motion, which is not only independent of the other player's Brownian motion but also not…

Probability · Mathematics 2025-04-16 Georgy Gaitsgori , Richard Groenewald

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 class of optimal stopping games (Dynkin games) of preemption type, with uncertainty about the existence of competitors. The set-up is well-suited to model, for example, real options in the context of investors who do not want to…

Probability · Mathematics 2019-05-17 Tiziano De Angelis , Erik Ekström

We consider the mean-field game where each agent determines the optimal time to exit the game by solving an optimal stopping problem with reward function depending on the density of the state processes of agents still present in the game.…

Optimization and Control · Mathematics 2020-07-09 Géraldine Bouveret , Roxana Dumitrescu , Peter Tankov

In the nonzero-sum setting, we establish a connection between Nash equilibria in games of optimal stopping (Dynkin games) and generalised Nash equilibrium problems (GNEP). In the Dynkin game this reveals novel equilibria of threshold type…

Probability · Mathematics 2022-08-09 Randall Martyr , John Moriarty

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 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

We study an infinite-horizon discrete-time optimal stopping problem under non-exponential discounting. A new method, which we call the iterative approach, is developed to find subgame perfect Nash equilibria. When the discount function…

Optimization and Control · Mathematics 2021-07-15 Yu-Jui Huang , Zhou Zhou

This paper studies a nonzero-sum Dynkin game in discrete time under non-exponential discounting. For both players, there are two levels of game-theoretic reasoning intertwined. First, each player looks for an intra-personal equilibrium…

Optimization and Control · Mathematics 2022-05-09 Yu-Jui Huang , Zhou Zhou

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…

Computer Science and Game Theory · Computer Science 2012-11-20 Ivan Guo

In this paper we study the N-player nonzero-sum Dynkin game ($N\geq 3$) in continuous time, which is a non-cooperative game where the strategies are stopping times. We show that the game has a Nash equilibrium point for general payoff…

Computer Science and Game Theory · Computer Science 2011-10-27 Hamadene Said , Hassani Mohammed

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

This paper studies a 2-players zero-sum Dynkin game arising from pricing an option on an asset whose rate of return is unknown to both players. Using filtering techniques we first reduce the problem to a zero-sum Dynkin game on a…

Probability · Mathematics 2019-05-20 Tiziano De Angelis , Fabien Gensbittel , Stéphane Villeneuve

We use martingale and stochastic analysis techniques to study a continuous-time optimal stopping problem, in which the decision maker uses a dynamic convex risk measure to evaluate future rewards. We also find a saddle point for an…

Probability · Mathematics 2009-11-23 Erhan Bayraktar , Ioannis Karatzas , Song Yao

We consider a zero-sum continuous time stopping game in which the pay-off is revealed in the maximum of the two stopping times instead of the minimum, which is the case in Dynkin games.

Probability · Mathematics 2015-07-28 Erhan Bayraktar , Zhou Zhou

This paper analyses two-player nonzero-sum games of optimal stopping on a class of linear regular diffusions with not non-singular boundary behaviour (in the sense of It\^o and McKean (1974), p.\ 108). We provide sufficient conditions under…

Probability · Mathematics 2017-08-03 Tiziano De Angelis , Giorgio Ferrari , John Moriarty

Standard Markovian optimal stopping problems are consistent in the sense that the first entrance time into the stopping set is optimal for each initial state of the process. Clearly, the usual concept of optimality cannot in a…

Optimization and Control · Mathematics 2018-12-05 Sören Christensen , Kristoffer Lindensjö
‹ Prev 1 2 3 10 Next ›