pith. sign in

arxiv: 1203.2369 · v1 · pith:CWOKXRWEnew · submitted 2012-03-11 · 💱 q-fin.CP

Counterparty Risk Valuation: A Marked Branching Diffusion Approach

classification 💱 q-fin.CP
keywords counterpartyriskalgorithmbranchingcomputationmarkedmethodmonte-carlo
0
0 comments X
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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. XNet-Enhanced Deep BSDE Method and Numerical Analysis

    cs.CE 2025-02 unverdicted novelty 6.0

    Establishes convergence for non-Lipschitz generators via bounded double-well lemma and truncated BSDE analysis, plus XNet architecture for efficient 100D PDE computation.