On a recursive algorithm for pricing discrete barrier options

Dennis G. Llemit ()
Additional contact information
Dennis G. Llemit: Department of Mathematics, Adamson University, 1000 San Marcelino Street, Ermita, Manila, Philippines

International Journal of Financial Engineering (IJFE), 2015, vol. 02, issue 04, 1-12

Abstract: An alternative and simple algorithm for valuating the price of discrete barrier options is presented. This algorithm computes the price just exactly the same as the Cox–Ross–Rubinstein (CRR) model. As opposed to other pricing methodologies, this recursive algorithm utilizes only the terminal nodes of the binomial tree and it captures the intrinsic property, the knock-in or knock-out feature, of barrier options. In this paper, we apply the algorithm to compute the price of an Up and Out Put (UOP) barrier option and compare the results obtained from the CRR model. We then determine the time complexity of the algorithm and show that it is Θ(n2).

Keywords: UOP barrier option; time complexity; pricing algorithm (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S2424786315500474
Access to full text is restricted to subscribers

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:wsi:ijfexx:v:02:y:2015:i:04:n:s2424786315500474

Ordering information: This journal article can be ordered from

DOI: 10.1142/S2424786315500474

Access Statistics for this article

International Journal of Financial Engineering (IJFE) is currently edited by George Yuan

More articles in International Journal of Financial Engineering (IJFE) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().