Skip to main content

An Efficient, and Fast Convergent Algorithm for Barrier Options

  • Conference paper
Algorithmic Aspects in Information and Management (AAIM 2007)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4508))

Included in the following conference series:

Abstract

A barrier option is an option whose payoff depends on whether the price path of the underlying asset ever reaches certain predetermined price levels called the barriers. A single- (double-) barrier option is a barrier option with one (two, respectively) barrier(s). No simple and exact closed-form pricing formula for double-barrier options has been reported in the literature. This paper proposes a novel tree model that can price both single- and double-barrier options efficiently and accurately. This tree model achieves the high efficiency by combinatorial techniques and numerical accuracy by hitting the barriers exactly. Numerical experiments are given to verify the superiority of our method.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Boyle, P., Lau, S.: Bumping Against the Barrier with the Binomial Method. Journal of Derivatives 1, 6–14 (1994)

    Google Scholar 

  2. Cox, J., Ross, S., Rubinstein, M.: Option Pricing: A Simplified Approach. Journal of Financial Economics 7, 229–264 (1979)

    Article  MATH  Google Scholar 

  3. Derman, E., Kani, I., Ergener, D., Bardhan, I.: Enhanced Numerical Methods for Options with Barriers. Working Paper, Goldman Sachs (1995)

    Google Scholar 

  4. Figlewski, S., Gao, B.: The Adaptive Mesh Model: A New Approach to Efficient Option Pricing. Journal of Financial Economics 53, 313–351 (1999)

    Article  Google Scholar 

  5. Geman, H., Yor, M.: Pricing and Hedging Double-Barrier Options: A Probabilistic Approach. Mathematical Finance 6, 365–378 (1996)

    Article  MATH  Google Scholar 

  6. Luo, L.: Various Types of Double Barrier Options. Journal of Computational Finance 4, 125–138 (2001)

    Google Scholar 

  7. Lyuu, Y.D.: Very Fast Algorithms for Barrier Option Pricing and the Ballot Problem. Journal of Derivatives 5, 68–79 (1998)

    Google Scholar 

  8. Merton, R.: Theory of Rational Option Pricing. Bell Journal of Economics and Management 4, 141–183 (1973)

    Article  MathSciNet  Google Scholar 

  9. Reiner, E., Rubinstein, M.: Breaking Down the Barriers. Risk 4, 28–35 (1991)

    Google Scholar 

  10. Ritchken, P.: On Pricing Barrier Options. Journal of Derivatives 3, 19–28 (1995)

    Article  Google Scholar 

  11. Sidenius, J.: Double Barrier Options: Valuation by Path Counting. Journal of Computational Finance 1, 63–79 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ming-Yang Kao Xiang-Yang Li

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Dai, TS., Lyuu, YD. (2007). An Efficient, and Fast Convergent Algorithm for Barrier Options. In: Kao, MY., Li, XY. (eds) Algorithmic Aspects in Information and Management. AAIM 2007. Lecture Notes in Computer Science, vol 4508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72870-2_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72870-2_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72868-9

  • Online ISBN: 978-3-540-72870-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics