Application of simplest random walk algorithms for pricing barrier options
We demonstrate effectiveness of the first-order algorithm from [Milstein, Tretyakov. Theory Prob. Appl. 47 (2002), 53-68] in application to barrier option pricing. The algorithm uses the weak Euler approximation far from barriers and a special construction motivated by linear interpolation of the price near barriers. It is easy to implement and is universal: it can be applied to various structures of the contracts including derivatives on multi-asset correlated underlyings and can deal with various type of barriers. In contrast to the Brownian bridge techniques currently commonly used for pricing barrier options, the algorithm tested here does not require knowledge of trigger probabilities nor their estimates. We illustrate this algorithm via pricing a barrier caplet, barrier trigger swap and barrier swaption.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Naoto Kunitomo & Masayuki Ikeda, 1992. "Pricing Options With Curved Boundaries," Mathematical Finance, Wiley Blackwell, vol. 2(4), pages 275-298.
- Manishi Prasad & Peter Wahlqvist & Rich Shikiar & Ya-Chen Tina Shih, 2004. "A," PharmacoEconomics, Springer Healthcare | Adis, vol. 22(4), pages 225-244.
When requesting a correction, please mention this item's handle: RePEc:arx:papers:1211.5726. 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: (arXiv administrators)
If references are entirely missing, you can add them using this form.