Skip to main content

Efficiently Pricing European-Asian Options — Ultimate Implementation and Analysis of the AMO Algorithm

  • Conference paper
Algorithmic Applications in Management (AAIM 2005)

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

Included in the following conference series:

  • 1157 Accesses

Abstract

We propose an efficient and accurate randomized approximation algorithm for pricing a European-Asian option on the binomial tree model. For an option with the strike price X on an n-step binomial tree and any positive integer k, our algorithm runs in O(kn 2) time with the error bound O(X/k) which is independent of n. Our algorithm is a modification of the approximation algorithm developed by Aingworth, Motwani, and Oldham (2000) into a randomized algorithm, which improves the accuracy theoretically as well as practically.

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. Aingworth, D., Motwani, R., Oldham, J.D.: Accurate approximations for Asian options. In: Proc. 11th ACM-SIAM Symposium on Discrete Algorithms, pp. 891–900 (2000)

    Google Scholar 

  2. Akcoglu, K., Kao, M.-Y., Raghavan, S.V.: Fast pricing of European Asian options with provable accuracy: single-stock and basket options. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 404–415. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Azuma, K.: Weighted sum of certain dependent random variables. Tohoku Mathematical Journal 19, 357–367 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  4. Black, F., Scholes, M.: The pricing of options and corporate liabilities. Journal of Political Economy 81, 637–654 (1973)

    Article  Google Scholar 

  5. Chalasani, P., Jha, S., Egriboyun, F., Varikooty, A.: A refined binomial lattice for pricing American Asian options. Review of Derivatives Research 3, 85–105 (1999)

    Article  Google Scholar 

  6. Chalasani, P., Jha, S., Saias, I.: Approximate option pricing. Algorithmica 25, 2–21 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Chalasani, P., Jha, S., Varikooty, A.: Accurate approximation for European Asian options. Journal of Computational Finance 1, 11–29 (1998)

    Google Scholar 

  8. Cox, J.C., Ross, S.A., Rubenstein, M.: Option pricing: a simplified approach. Journal of Financial Economics 7, 229–263 (1979)

    Article  MATH  Google Scholar 

  9. Dai, T.-S., Huang, G.-S., Lyuu, Y.-D.: Extremely accurate and efficient tree algorithms for Asian options with range bounds. In: 2002 NTU International Conference on Finance, National Taiwan University, Taiwan (May 2002)

    Google Scholar 

  10. Glasserman, P.: Monte Carlo Method in Financial Engineering. Springer, Berlin (2004)

    Google Scholar 

  11. Hull, J.C.: Options, Futures, and Other Derivatives, 5th edn. Prentice Hall, Upper Saddle River (2002)

    Google Scholar 

  12. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge Univ. Press, London (1995)

    MATH  Google Scholar 

  13. Ohta, K., Sadakane, K., Shioura, A., Tokuyama, T.: A fast, accurate and simple method for pricing European-Asian and Saving-Asian options. Algorithmica (to appear)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shioura, A., Tokuyama, T. (2005). Efficiently Pricing European-Asian Options — Ultimate Implementation and Analysis of the AMO Algorithm. In: Megiddo, N., Xu, Y., Zhu, B. (eds) Algorithmic Applications in Management. AAIM 2005. Lecture Notes in Computer Science, vol 3521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496199_32

Download citation

  • DOI: https://doi.org/10.1007/11496199_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26224-4

  • Online ISBN: 978-3-540-32440-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics