Fast Correlation Greeks by Adjoint Algorithmic Differentiation

Luca Capriotti and Mike Giles

Papers from arXiv.org

Abstract: We show how Adjoint Algorithmic Differentiation (AAD) allows an extremely efficient calculation of correlation Risk of option prices computed with Monte Carlo simulations. A key point in the construction is the use of binning to simultaneously achieve computational efficiency and accurate confidence intervals. We illustrate the method for a copula-based Monte Carlo computation of claims written on a basket of underlying assets, and we test it numerically for Portfolio Default Options. For any number of underlying assets or names in a portfolio, the sensitivities of the option price with respect to all the pairwise correlations is obtained at a computational cost which is at most 4 times the cost of calculating the option value itself. For typical applications, this results in computational savings of several order of magnitudes with respect to standard methods.

Date: 2010-04
New Economics Papers: this item is included in nep-cmp and nep-rmg
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Published in Risk Magazine, April 2010

Downloads: (external link)
http://arxiv.org/pdf/1004.1855 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:1004.1855

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().