skip to main content
10.1145/3481127.3481246acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicemeConference Proceedingsconference-collections
research-article

Comparison of Chinese 50 ETF put option pricing based on four algorithms

Published:02 December 2021Publication History

ABSTRACT

The article starts with the traditional Black-Scholes(B-S) option pricing models. Three more models: Long-term and short-term memory networks(LSTM), support vector machine (SVM) and random forest(RF) are introduced to be compared to the B-S model and to each other on 50 ETF put option pricing. It is showed that each model has its advantages when used in different position. The neural network pricing result is better than that of the B-S model From the four evaluation indicators of MD, MSD, MAD and MPD, the absolute values of the four errors of the prediction results of the neural network are all smaller than the absolute values of the corresponding errors of the prediction results of the B-S model.

References

  1. Henrik Amilon. 2003. A neural network versus Black–Scholes: a comparison of pricing and hedging performances. Journal of Forecasting 22, 4 (2003), 317–335.Google ScholarGoogle ScholarCross RefCross Ref
  2. Henrik Amilon. 2003. A neural network versus Black–Scholes: a comparison of pricing and hedging performances. Journal of Forecasting 22, 4 (2003), 317–335.Google ScholarGoogle ScholarCross RefCross Ref
  3. Fischer Black and Myron Scholes. 2019. The pricing of options and corporate liabilities. In World Scientific Reference on Contingent Claims Analysis in Corporate Finance: Volume 1: Foundations of CCA and Equity Valuation. World Scientific, 3–21.Google ScholarGoogle Scholar
  4. Leo Breiman. 2001. Random forests. Machine learning 45, 1 (2001), 5–32.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Christine A Brown and David M Robinson. 2002. Skewness and kurtosis implied by option prices: A correction. Journal of Financial Research 25, 2 (2002), 279–282.Google ScholarGoogle ScholarCross RefCross Ref
  6. F Dan Foresee and Martin T Hagan. 1997. Gauss-Newton approximation to Bayesian learning. In Proceedings of international conference on neural networks (ICNN’97), Vol. 3. IEEE, 1930–1935.Google ScholarGoogle ScholarCross RefCross Ref
  7. Tin Kam Ho. 1995. Random decision forests. In Proceedings of 3rd international conference on document analysis and recognition, Vol. 1. IEEE, 278–282.Google ScholarGoogle Scholar
  8. Tin Kam Ho. 1998. The random subspace method for constructing decision forests. IEEE Transactions on Pattern Analysis and Machine Intelligence 20, 8(1998), 832–844.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Robert W Kolb and James A Overdahl. 2003. Futures, options, and swaps. Vol. 5. Blackwell.Google ScholarGoogle Scholar
  10. Daewon Lee and Jaewook Lee. 2007. Equilibrium-based support vector machine for semisupervised classification. IEEE Transactions on Neural Networks 18, 2 (2007), 578–583.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Xiaosheng Liu and Zhibang Zhang. 2019. Parameter optimization of Support Vector Machine based on improved grid search method. IEEE Transactions on Neural Networks 40, 1 (2019), 5–9.Google ScholarGoogle Scholar
  12. Vladimir Vapnik, Esther Levin, and Yann Le Cun. 1994. Measuring the VC-dimension of a learning machine. Neural computation 6, 5 (1994), 851–876.Google ScholarGoogle Scholar

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Other conferences
    ICEME '21: Proceedings of the 2021 12th International Conference on E-business, Management and Economics
    July 2021
    882 pages
    ISBN:9781450390064
    DOI:10.1145/3481127

    Copyright © 2021 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 2 December 2021

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article
    • Research
    • Refereed limited
  • Article Metrics

    • Downloads (Last 12 months)13
    • Downloads (Last 6 weeks)0

    Other Metrics

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format .

View HTML Format