Abstract
This paper provides a discrete time algorithm, in the framework of the Cox–Ross–Rubinstein analysis (1979), to evaluate both Parisian options with a flat barrier and Parisian options with an exponential boundary. The algorithm is based on a combinatorial tool for counting the number of paths of a particle performing a random walk, that remains beyond a barrier constantly for a period strictly smaller than a pre-specified time interval. As a result, a binomial evaluation model is derived that is very easy to implement and that produces highly accurate prices.
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.
