SearcharxivSearch

arXiv · 1210.5364

BSDEs with weak terminal condition

Abstract

We introduce a new class of Backward Stochastic Differential Equations in which the $T$-terminal value $Y_{T}$ of the solution $(Y,Z)$ is not fixed as a random variable, but only satisfies a weak constraint of the form $E[Ψ(Y_{T})]\ge m$, for some (possibly random) non-decreasing map $Ψ$ and some threshold $m$. We name them \textit{BSDEs with weak terminal condition} and obtain a representation of the minimal time $t$-values $Y_{t}$ such that $(Y,Z)$ is a supersolution of the BSDE with weak terminal condition. It provides a non-Markovian BSDE formulation of the PDE characterization obtained for Markovian stochastic target problems under controlled loss in Bouchard, Elie and Touzi \cite{BoElTo09}. We then study the main properties of this minimal value. In particular, we analyze its continuity and convexity with respect to the $m$-parameter appearing in the weak terminal condition, and show how it can be related to a dual optimal control problem in Meyer form. These last properties generalize to a non Markovian framework previous results on quantile hedging and hedging under loss constraints obtained in Föllmer and Leukert \cite{FoLe99,FoLe00}, and in Bouchard, Elie and Touzi \cite{BoElTo09}.

Explore related subjects

Keep this discovery

BibTeXRIS

Bruno Bouchard, Romuald Elie, Anthony Réveillac. 2014-02-24. BSDEs with weak terminal condition. https://arxiv.org/abs/1210.5364

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