Counterparty Risk Valuation: A Marked Branching Diffusion Approach
read the original abstract
The purpose of this paper is to design an algorithm for the computation of the counterparty risk which is competitive in regards of a brute force "Monte-Carlo of Monte-Carlo" method (with nested simulations). This is achieved using marked branching diffusions describing a Galton-Watson random tree. Such an algorithm leads at the same time to a computation of the (bilateral) counterparty risk when we use the default-risky or counterparty-riskless option values as mark-to-market. Our method is illustrated by various numerical examples.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
XNet-Enhanced Deep BSDE Method and Numerical Analysis
Establishes convergence for non-Lipschitz generators via bounded double-well lemma and truncated BSDE analysis, plus XNet architecture for efficient 100D PDE computation.
-
Algorithmically Designed Artificial Neural Networks (ADANNs): Higher order deep operator learning for parametric partial differential equations
ADANNs design ANN architectures and initializations to mimic classical numerical algorithms for parametric PDE operator approximation and report significant outperformance over existing methods in numerical tests.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.