Perturbation Stable Conditional Analytic Monte-Carlo Pricing Scheme For Auto-Callable Products
In this paper, we present a generic method for the Monte-Carlo pricing of (generalized) auto-callable products (aka. trigger products), i.e., products for which the payout function features a discontinuity with a (possibly) stochastic location (the trigger) and value (the payout).The Monte-Carlo pricing of products with discontinuous payout is known to come with a high Monte-Carlo error. The numerical calculation of sensitivities (i.e., partial derivatives) of such prices by finite differences gives very noisy results, since the Monte-Carlo approximation (being a finite sum of discontinuous functions) is not smooth. Additionally, the Monte-Carlo error of the finite-difference approximation explodes as the shift size tends to zero.Our method combines a product specific modification of the underlying numerical scheme, which is to some extent similar to an importance sampling and/or partial proxy simulation scheme and a reformulation of the payoff function into an equivalent smooth payout.From the financial product we merely require that hitting of the stochastic trigger will result in an conditionally analytic value. Many complex derivatives can be written in this form. A class of products where this property is usually encountered are the so called auto-callables, where a trigger hit results in cancellation of all future payments except for one redemption payment, which can be valued analytically, conditionally on the trigger hit.From the model we require that its numerical implementation allows for a calculation of the transition probability of survival (i.e., non-trigger hit). Many models allows this, e.g., Euler schemes of Itô processes, where the trigger is a model primitive.The method presented is effective across a large range of cases where other methods fail, e.g. small finite difference shift sizes or short time to trigger reset (approaching maturity); this means that a practitioner can use this method and be confident that it will work consistently.The method itself can be viewed as a generalization of the method proposed by Glasserman and Staum (2001), both with respect to the type (and shape) of the boundaries, as well as, with respect to the class of products considered. In addition we explicitly consider the calculation of sensitivities.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 14 (2011)
Issue (Month): 02 ()
|Contact details of provider:|| Web page: http://www.worldscinet.com/ijtaf/ijtaf.shtml|
|Order Information:|| Email: |
When requesting a correction, please mention this item's handle: RePEc:wsi:ijtafx:v:14:y:2011:i:02:p:197-219. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Tai Tone Lim)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.