SearcharxivSearch

arXiv · 2212.12854

Well-posedness and penalization schemes for generalized BSDEs and reflected generalized BSDEs

Abstract

The paper is directly motivated by the pricing of vulnerable European and American options in a general hazard process setup and a related study of the corresponding pre-default backward stochastic differential equations (BSDE) and pre-default reflected backward stochastic differential equations (RBSDE). We work with a generic filtration $\FF$ for which the martingale representation property is assumed to hold with respect to a square-integrable martingale $M$ and the goal of this work is of twofold. First, we aim to establish the well-posedness results and comparison theorems for a generalized BSDE and a reflected generalized BSDE with a continuous and nondecreasing driver $A$. Second, we study extended penalization schemes for a generalized BSDE and a reflected generalized BSDE in which we penalize against the driver in order to obtain in the limit either a particular optimal stopping problem or a Dynkin game in which the set of admissible exercise time is constrained to the right support of the measure generated by $A$.

Explore related subjects

Keep this discovery

BibTeXRIS

Libo Li, Ruyi Liu, Marek Rutkowski. 2022-12-25. Well-posedness and penalization schemes for generalized BSDEs and reflected generalized BSDEs. https://arxiv.org/abs/2212.12854

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