Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/258025 
Year of Publication: 
2020
Citation: 
[Journal:] Risks [ISSN:] 2227-9091 [Volume:] 8 [Issue:] 3 [Article No.:] 72 [Publisher:] MDPI [Place:] Basel [Year:] 2020 [Pages:] 1-30
Publisher: 
MDPI, Basel
Abstract: 
We study numerical algorithms for reflected anticipated backward stochastic differential equations (RABSDEs) driven by a Brownian motion and a mutually independent martingale in a defaultable setting. The generator of a RABSDE includes the present and future values of the solution. We introduce two main algorithms, a discrete penalization scheme and a discrete reflected scheme basing on a random walk approximation of the Brownian motion as well as a discrete approximation of the default martingale, and we study these two methods in both the implicit and explicit versions respectively. We give the convergence results of the algorithms, provide a numerical example and an application in American game options in order to illustrate the performance of the algorithms.
Subjects: 
numerical algorithm
reflected anticipated backward stochastic differential equations
discrete penalization scheme
discrete reflected scheme
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Appears in Collections:

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.