Solving Unbounded Quadratic BSDEs by a Domination Method * - Université de Toulon Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2019

Solving Unbounded Quadratic BSDEs by a Domination Method *

Résumé

We introduce a domination argument which asserts that: if we can dominate the parameters of a quadratic backward stochastic differential equation (QBSDE) with continuous generator from above and from below by those of two BSDEs having ordered solutions, then also the original QBSDE admits at least one solution. This result is presented in a general framework: we do not impose any integrability condition on none of the terminal data of the three involved BSDEs, we do not require any constraint on the growth nor continuity of the two dominating generators. As a consequence, we establish the existence of a maximal and a minimal solution to BSDEs whose coefficient H is continuous and satisfies |H(t, y, z)| ≤ α t + β t |y| + θ t |z| + f (|y|)|z| 2 , where α t , β t , θ t are positive processes and the function f is positive and locally bounded on R. This is done with unbounded terminal value. We cover the classical QBSDEs where the function f is constant and also the cases where the generator has super linear growth such as y|z|, e |y| k |z| p , e e |y| |z| 2 , (k ≥ 0, 0 ≤ p < 2) and so on. In contrast to the works [12, 14, 23, 25, 27], we get the existence of a solution, moreover we cover the BSDEs with at most linear growth (take f = 0), in particular we extend the results of [24] and [26]. The existence and uniqueness of solutions are also established for BSDEs driven by f (y)|z| 2 when f is merely locally integrable on R.
Fichier principal
Vignette du fichier
KB_qbsde_arxiv_janv.pdf (284.24 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01972711 , version 1 (07-01-2019)
hal-01972711 , version 2 (26-03-2019)

Identifiants

  • HAL Id : hal-01972711 , version 1

Citer

Khaled Bahlali. Solving Unbounded Quadratic BSDEs by a Domination Method *. 2019. ⟨hal-01972711v1⟩
934 Consultations
235 Téléchargements

Partager

Gmail Facebook X LinkedIn More