Search arXivSearch

arXiv · 1310.2764

Generalized Dynkin Games and Doubly Reflected BSDEs with Jumps

Abstract

We introduce a generalized Dynkin game problem with non linear conditional expectation ${\cal E}$ induced by a Backward Stochastic Differential Equation (BSDE) with jumps. Let $ξ, ζ$ be two RCLL adapted processes with $ξ\leq ζ$. The criterium is given by \begin{equation*} {\cal J}_{τ, σ}= {\cal E}_{0, τ\wedge σ} \left(ξ_τ\textbf{1}_{\{ τ\leq σ\}}+ζ_σ\textbf{1}_{\{σ<τ\}}\right) \end{equation*} where $τ$ and $ σ$ are stopping times valued in $[0,T]$. Under Mokobodski's condition, we establish the existence of a value function for this game, i.e. $\inf_σ\sup_τ {\cal J}_{τ, σ} = \sup_τ \inf_σ {\cal J}_{τ, σ}$. This value can be characterized via a doubly reflected BSDE. Using this characterization, we provide some new results on these equations, such as comparison theorems and a priori estimates. When $ξ$ and $ζ$ are left upper semicontinuous along stopping times, we prove the existence of a saddle point. We also study a generalized mixed game problem when the players have two actions: continuous control and stopping. We then address the generalized Dynkin game in a Markovian framework and its links with parabolic partial integro-differential variational inequalities with two obstacles.

Explore related subjects

Keep this discovery

BibTeXRIS

Roxana Dumitrescu, Marie-Claire Quenez, Agnès Sulem. 2014-10-02. Generalized Dynkin Games and Doubly Reflected BSDEs with Jumps. https://arxiv.org/abs/1310.2764

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR