2019
DOI: 10.1017/apr.2019.19
|View full text |Cite
|
Sign up to set email alerts
|

A probabilistic verification theorem for the finite horizon two-player zero-sum optimal switching game in continuous time

Abstract: In this paper we study continuous-time two-player zero-sum optimal switching games on a finite horizon. Using the theory of doubly reflected BSDEs with interconnected barriers, we show that this game has a value and an equilibrium in the players' switching controls.MSC2010 Classification: 91A15, 91A55, 91A05, 93E20, 60G40, 49N25.JEL Classification: C61, C72, C73.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(8 citation statements)
references
References 36 publications
0
8
0
Order By: Relevance
“…Here we should point out that since the switching of the system is made from i to i + 1 and the players do not have their proper sets of switching modes, then the method used e.g. in [10] cannot be applied in our framework. As a consequence of this fact, the question of a solution of (1.1) outside the Markovian framework still open.…”
Section: As For Anymentioning
confidence: 99%
See 4 more Smart Citations
“…Here we should point out that since the switching of the system is made from i to i + 1 and the players do not have their proper sets of switching modes, then the method used e.g. in [10] cannot be applied in our framework. As a consequence of this fact, the question of a solution of (1.1) outside the Markovian framework still open.…”
Section: As For Anymentioning
confidence: 99%
“…It means that the decision makers do not have their proper modes to which they can switch the system when they decide to switch (see e.g. [10] for more details on this model). Therefore a switching strategy for the players are sequences of stopping times u = (σ n ) n≥0 for C 1 and v = (τ n ) n≥0 for C 2 such that σ n ≤ σ n+1 and τ n ≤ τ n+1 for any n ≥ 0.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations