2016
DOI: 10.1080/17442508.2016.1166505
|View full text |Cite
|
Sign up to set email alerts
|

Optimal stopping and a non-zero-sum Dynkin game in discrete time with risk measures induced by BSDEs

Abstract: 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 game on discrete stopping times with two agents who aim at minimizing their respective risks. The payoffs of the agents are assessed by g-expectations (with possibly different drivers for the different players). By using the results of the first part, combined with some ideas of … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
10
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
3

Relationship

2
6

Authors

Journals

citations
Cited by 15 publications
(11 citation statements)
references
References 30 publications
0
10
0
Order By: Relevance
“…For each τ ∈ T S,T , we set τ A := τ 1 A + T 1 A c . We have τ A ≥ S ′ a.s. By using the fact that S = S ′ a.s. on A, the fact that τ A = τ a.s. on A, and a standard property of conditional f -expectations (cf., e.g., Proposition A.3 in [19] which can be extended without difficulty to the framework of general filtration), we obtain…”
mentioning
confidence: 85%
“…For each τ ∈ T S,T , we set τ A := τ 1 A + T 1 A c . We have τ A ≥ S ′ a.s. By using the fact that S = S ′ a.s. on A, the fact that τ A = τ a.s. on A, and a standard property of conditional f -expectations (cf., e.g., Proposition A.3 in [19] which can be extended without difficulty to the framework of general filtration), we obtain…”
mentioning
confidence: 85%
“…For sake of simplicity, a pure OLNED will be simply called an OLNED. Inspired by the literature on optimal stopping in non-zero sum games in discrete time, see among others Grigorova and Quenez (2017); Riedel and Steg (2017), we aim at finding OLNED in the sense of the above definition.…”
Section: Discretised Gamementioning
confidence: 99%
“…Doubly reflected BSDEs were first introduced and studied by Cvitanić and Karatzas [11] who also showed that classical Dynkin games can be solved using the theory of doubly reflected BSDEs. Their studies were continued by, among others, Bayraktar and Yao [6], Crépey and Matoussi [10], Dumitrescu et al [14], Essaky and Hassani [25], Grigorova et al [27], Grigorova and Quenez [28], Hamadène and Lepeltier [30], Hamadène and Ouknine [31], Hamadène and Wang [32], Kobylanski et al [46], and Lepeltier and San Martín [48]. For a survey of results on Dynkin games and their applications to the valuation and hedging of game options, the reader is referred to Kifer [38].…”
Section: Introductionmentioning
confidence: 95%