skip to main content
10.1145/1370256.1370260acmotherconferencesArticle/Chapter ViewAbstractPublication PagesuccsConference Proceedingsconference-collections
research-article

A bioinspired algorithm to price options

Published: 12 May 2008 Publication History

Abstract

Computing option prices is a challenging problem. Finding the best time to exercise an option is a even more challenging problem. One has to be watchful for the price changes in the market place and act at the right time. That is, prices need to be policed. This paper proposes a novel idea for pricing options using a nature inspired meta-heuristic algorithm, Ant Colony Optimization (ACO). ACO has been used extensively in combinatorial optimization problems and recently in dynamic applications such as mobile ad-hoc networks. Specifically, we adapt the general ACO algorithm to apply to a totally different application, computational finance, in the current study. We police the prices using ants to decide on the best time to exercise so that the holder of the option contract will get the maximum benefit out of his/her investment. Our algorithm and implementation suggests a better way to price options than traditional numerical techniques such as binomial lattice algorithm. From our results we conclude that reactive ants may be best suited for long-dated options whose performance can still be improved.

References

[1]
F. Black and M. Scholes. The pricing of options and corporate liabilities. Journal of Political Economy, 81:637--654, Jan 1973.
[2]
A. Brabozan and M. O'Neill. Biologically Inspired Algorithms for Financial Modelling. Springer, New York, 2006.
[3]
B. Bullnheimer, C. Strauss, and R. F. Hartl. An improved ant system algorithm for the vehicle routing problem. In Annals of Operations Research, volume 89, pages 319--328, 1999.
[4]
G. D. Caro and M. Dorigo. AntNet: Distributed stigmergetic control for communications networks. Journal of Artificial Intelligence Research, 9:317--365, 1998.
[5]
G. D. Caro, F. Ducatelle, and L. M. Gambardella. AntHocNet: An adaptive nature-inspired algorithm for routing in mobile ad hoc networks. European Transactions on Telecommunications (ETT), Special Issue on Self Organization in Mobile Networking, 16(5):443--455, 2005.
[6]
J. C. Cox, S. A. Ross, and M. Rubinstein. Options pricing: a simplified approach. Journal of Financial Economics, 7:229--263, 1979.
[7]
P. Delisle, M. Krakecki, M. Gravel, and C. Gagné. Parallel implementation of an ant colony optimization metaheuristic with OpenMP. In International Conference of Parallel Architectures and Complication Techniques, Proceedings of the Third European Workshop on OpenMP, pages 8--12, Barcelona, Spain, September 2001.
[8]
M. Dorigo, E. Bonabeau, and G. Theraulaz. Swarm Intelligence: From natural to artifical systems. Oxford University Press, New York, NY, 1999.
[9]
M. Dorigo, G. D. Caro, and L. M. Gambardella. Ant colony optimization: A new meta-heuristic. In P. J. Angeline, Z. Michalewicz, M. Schoenauer, X. Yao, and A. Zalzala, editors, Proceedings of the Congress on Evolutionary Computation, volume 2, pages 1470--1477, Mayflower Hotel, Washington D.C., USA, 6--9 1999. IEEE Press.
[10]
M. Dorigo and L. M. Gambardella. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1):53--66, April 1997.
[11]
M. Dorigo, V. Maniezzo, and A. Colorni. The Ant System: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics Part B: Cybernetics, 26(1):29--41, 1996.
[12]
M. Dorigo and T. Stützle. Ant Colony Optimization. MIT Press, Cambridge, MA, May 2004.
[13]
M. Gunes, U. Sorges, and I. Bouazzi. ARA -- the ant-colony based routing algorithm for MANETs. In Proceedings of the international conference on parallel processing workshops (ICPPW'02), pages 79--85, Vancouver, B.C., August 2002.
[14]
J. C. Hull. Options, futures, and other derivative securities. Prentice Hall, Englewood-Cliff, N.J., May 2006.
[15]
M. T. Islam, P. Thulasiraman, and R. K. Thulasiram. Implementation of ant colony optimization algorithm for mobile ad hoc network applications: OpenMP experiences. Parallel and Distributed Computing Practices Journal, 2:61--73, 2004.
[16]
C. Keber and M. G. Schuster. Generalized ant programming in option pricing: Determining implied volatilities based on American put options. In Proceedings of the IEEE International Conference on Computational Intelligence for Financial Engineering, pages 123--130, Hong Kong Convention and Exhibition Centre, Hong Kong, March, 2003.
[17]
J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, Mass., 1992.
[18]
V. Maniezzo and A. Colorni. The ant system applied to the quadratic assignment problem. IEEE Transactions on Knowledge and Data Engineering, 11(5):769--778, 1999.
[19]
R. C. Merton. Theory of rational option pricing. Bell Journal of Economics, 4:141--183, 1973.
[20]
S. Rahmail, I. Shiller, and R. K. Thulasiram. Different estimators of the underlying asset's volatility and option pricing errors: parallel Monte-Carlo simulation. In Proceedings of the International Conference on Computational Finance and its Applications (ICCFA), pages 121--131, Bologna, Italy, 2004.
[21]
M. Randall and A. Lewis. A parallel implementation of ant colony optimization. Journal of Parallel and Distributed Computing, 62(9):1421--1432, 2002.
[22]
R. K. Thulasiram, L. Litov, H. Nojumi, C. Downing, and G. Gao. Multithreaded algorithms for pricing a class of complex options. In Proceedings (CD-RoM) of the IEEE/ACM International Parallel and Distribued Processing Symposium (IPDPS), San Francisco, CA, 2001.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
C3S2E '08: Proceedings of the 2008 C3S2E conference
May 2008
240 pages
ISBN:9781605581019
DOI:10.1145/1370256
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]

Sponsors

  • BytePress
  • Concordia University: Concordia University

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 May 2008

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. ant colony optimization
  2. computational finance
  3. optimal solution
  4. option pricing
  5. swarm intelligence

Qualifiers

  • Research-article

Conference

C3S2E '08
Sponsor:
  • Concordia University

Acceptance Rates

Overall Acceptance Rate 12 of 42 submissions, 29%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)6
  • Downloads (Last 6 weeks)0
Reflects downloads up to 23 Dec 2024

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media