Branching particle pricers with Heston examples

From MaRDI portal
Publication:5221479

DOI10.1142/S021902492050003XzbMATH Open1443.91296arXiv1907.00219OpenAlexW2995480943WikidataQ126560077 ScholiaQ126560077MaRDI QIDQ5221479FDOQ5221479


Authors: Michael A. Kouritzin, Anne MacKay Edit this on Wikidata


Publication date: 26 March 2020

Published in: International Journal of Theoretical and Applied Finance (Search for Journal in Brave)

Abstract: The use of sequential Monte Carlo within simulation for path-dependent option pricing is proposed and evaluated. Recently, it was shown that explicit solutions and importance sampling are valuable for efficient simulation of spot price and volatility, especially for purposes of path-dependent option pricing. The resulting simulation algorithm is an analog to the weighted particle filtering algorithm that might be improved by resampling or branching. Indeed, some branching algorithms are shown herein to improve pricing performance substantially while some resampling algorithms are shown to be less suitable in certain cases. A historical property is given and explained as the distinguishing feature between the sequential Monte Carlo algorithms that work on path-dependent option pricing and those that do not. In particular, it is recommended to use the so-called effective particle branching algorithm within importance-sampling Monte Carlo methods for path-dependent option pricing. All recommendations are based upon numeric comparison of option pricing problems in the Heston model.


Full work available at URL: https://arxiv.org/abs/1907.00219




Recommendations




Cites Work


Cited In (5)





This page was built for publication: Branching particle pricers with Heston examples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5221479)