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 [Formula: see text].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
