English
Related papers

Related papers: Dynkin Games for L\'evy Processes

200 papers

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

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

Zero-sum Dynkin games under Poisson constraints, where players can only stop at the event times of a Poisson process, have been studied widely in the recent literature. The constraint can be modelled in two ways: either both players share…

Optimization and Control · Mathematics 2025-12-09 David Hobson , Gechun Liang , Edward Wang

This paper introduces a new class of Dynkin games, where the two players are allowed to make their stopping decisions at a sequence of exogenous Poisson arrival times. The value function and the associated optimal stopping strategy are…

Optimization and Control · Mathematics 2019-07-18 Gechun Liang , Haodong Sun

Explicit solution of an infinite horizon optimal stopping problem for a Levy processes with a polynomial reward function is given, in terms of the overall supremum of the process, when the solution of the problem is one-sided. The results…

Probability · Mathematics 2015-07-23 Ernesto Mordecki , Yuliya Mishura

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

We revisit the Dynkin game problem in a general framework, improve classical results and relax some assumptions. The criterion is expressed in terms of families of random variables indexed by stopping times. We construct two nonnegative…

Probability · Mathematics 2013-08-15 Magdalena Kobylanski , Marie-Claire Quenez , Marc Roger de Campagnolle

We study a stopping game of preemption type between two players who both act under uncertain competition. In this framework we introduce, and study the effect of, (i) asymmetry of payoffs, allowing e.g. for different investment costs, and…

Probability · Mathematics 2024-11-08 Erik Ekström , Yuqiong Wang

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…

Optimization and Control · Mathematics 2022-05-06 Boualem Djehiche , Roxana Dumitrescu

In the literature on optimal stopping, the problem of maximizing the expected discounted reward over all stopping times has been explicitly solved for some special reward functions (including $(x^+)^{\nu}$, $(e^x-K)^+$, $(K-e^{-x})^+$,…

Probability · Mathematics 2017-10-13 Yi-Shen Lin , Yi-Ching Yao

We consider a process $Z$ on the real line composed from a L\'evy process and its exponentially tilted version killed with arbitrary rates and give an expression for the joint law of $Z$ seen from its supremum, the supremum $\overline Z$…

Probability · Mathematics 2014-05-15 Sebastian Engelke , Jevgenijs Ivanovs

In the paper "Dynkin Games Via Dirichlet Forms and Singular Control of One-Dimensional Diffusion", the authors tried to show the existences of a smooth value function and an optimal policy to a one-dimensional stochastic singular control…

Optimization and Control · Mathematics 2013-07-11 Yipeng Yang

We adapt the Stochastic Perron's method in Bayraktar and Sirbu (ArXiv: 1103.0538) to the case of double obstacle problems associated to Dynkin games. We construct, symmetrically, a viscosity sub-solution which dominates the upper value of…

Optimization and Control · Mathematics 2012-01-30 Erhan Bayraktar , Mihai Sirbu

The traditional difficulty about stochastic singular control is to characterize the regularities of the value function and the optimal control policy. In this paper, a multi-dimensional singular control problem is considered. We found the…

Optimization and Control · Mathematics 2014-06-17 Yipeng Yang

We first study an optimal stopping problem in which a player (an agent) uses a discrete stopping time in order to stop optimally a payoff process whose risk is evaluated by a (non-linear) $g$-expectation. We then consider a non-zero-sum…

Probability · Mathematics 2017-05-11 Miryana Grigorova , Marie-Claire Quenez

On a filtered probability space $(\Omega,\mathcal{F},P,\mathbb{F}=(\mathcal{F}_t)_{t=0,\dotso,T})$, we consider stopper-stopper games $\overline V:=\inf_{\Rho\in\bT^{ii}}\sup_{\tau\in\T}\E[U(\Rho(\tau),\tau)]$ and $\underline…

Probability · Mathematics 2017-03-29 Erhan Bayraktar , Zhou Zhou

In optimal stopping problems, a Markov structure guarantees Markovian optimal stopping times (first exit times). Surprisingly, there is no analogous result for Markovian stopping games once randomization is required. This paper addresses…

Probability · Mathematics 2024-08-02 Sören Christensen , Boy Schultz

We provide, in a general setting, explicit solutions for optimal stopping problems that involve a diffusion process and its running maximum. Besides, a new feature includes absorbing boundaries that vary with the value of the running…

Optimization and Control · Mathematics 2016-02-16 Masahiko Egami , Tadao Oryu

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