Application of simplest random walk algorithms for pricing barrier options

M. Krivko and M. V. Tretyakov

Papers from arXiv.org

Abstract: 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.

Date: 2012-11
New Economics Papers: this item is included in nep-cmp and nep-fmk
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/1211.5726 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:1211.5726

Access Statistics for this paper

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