skip to main content
10.1145/1132516.1132586acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
Article

Online trading algorithms and robust option pricing

Published:21 May 2006Publication History

ABSTRACT

In this work we show how to use efficient online trading algorithms to price the current value of financial instruments, such as an option. We derive both upper and lower bounds for pricing an option, using online trading algorithms.Our bounds depend on very minimal assumptions and are mainly derived assuming that there are no arbitrage opportunities.

References

  1. Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, and Robert E. Schapire. The nonstochastic multiarmed bandit problem. SIAM J. on Computing, 32(1), 2002. A preliminary version appeared in FOCS 1995 as "Gambling in a rigged casino: The adversarial multi-armed bandit problem". Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Antonio E. Bernardo and Olivier Ledoit. Gain, loss and asset pricing. Journal of Political Economy, 108(1):144--172, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  3. Fisher Black and Myron Scholes. The pricing of options and corporate liabilities. Journal of Political Economy, 81(3):637--654, 1973.Google ScholarGoogle ScholarCross RefCross Ref
  4. Blum and Kalai. Universal portfolios with and without transaction costs. In COLT: Proceedings of the Workshop on Computational Learning Theory, Morgan Kaufmann Publishers, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Nicolò Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert E. Schapire, and Manfred K. Warmuth. How to use expert advice. Journal of the Association for Computing Machinery, 44(3), 1997. A preliminary version appeared in STOC 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Nicolò Cesa-Bianchi, Yishay Mansour, and Gilles Stoltz. Improved second-order bounds for prediction with expert advice. to appear in COLT, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. A. Chou, J. Cooperstock, R. El-Yaniv, M. Klugerman, and T. Leighton. The statistical adversary allows optimal money-making trading strategies. In Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 467--476, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. John H. Cochrane and Jesus Saa-Requejo. Beyond arbitrage: Good-deal asset price bounds in incomplete markets. Journal of Political Economy, 108(1):79--119, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  9. T. Cover. Universal portfolios. Mathematical Finance, 1(1):1--29, 1991.Google ScholarGoogle ScholarCross RefCross Ref
  10. T. Cover and E. Ordentlich. Universal portfolios with side information. IEEE Transactions on Information Theory, 42(2):348--368, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. T. Cover and E. Ordentlich. The cost of achieving the best portfolio in hindsight. Mathematics of Operations Research, 23(4):960--982, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Darrell Duffie. Dynamic Asset Pricing Theory. Princeton University Press, 2001.Google ScholarGoogle Scholar
  13. R. El-Yaniv, A. Fiat, R.M. Karp, and G. Turpin. Optimal search and one-way trading online algorithms. Algorithmica, 30(1):101--139, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  14. Ran El-Yaniv, Amos Fiat, Richard M. Karp, and G. Turpin. Competitive analysis of financial games. In IEEE Symposium on Foundations of Computer Science, pages 327--333, 1992.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Bjorn Eraker. Do stock prices and volatility jump? reconciling evidence from spot and option prices. Journal of Finance, 59:1367--1403, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  16. Bjorn Eraker, Michael Johannes, and Nicholas G. Polson. The impact of jumps in returns and volatility. Journal of Finance, 53:1269--1300, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  17. D. Foster and R. Vohra. Regret in the on-line decision problem. Games and Economic Behavior, 21:40--55, 1997.Google ScholarGoogle ScholarCross RefCross Ref
  18. D. Foster and R. Vohra. Asymptotic calibration. Biometrika, 85:379--390, 1998.Google ScholarGoogle ScholarCross RefCross Ref
  19. Yoav Freund and Robert E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. In Euro-COLT, pages 23--37. Springer-Verlag, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. S. Hart and A. Mas-Colell. A simple adaptive procedure leading to correlated equilibrium. Econometrica, 68:1127--1150, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  21. David P. Helmbold, Robert E. Schapire, Yoram Singer, and Manfred K. Warmuth. On-line portfolio selection using multiplicative updates. In International Conference on Machine Learning, pages 243--251, 1996.Google ScholarGoogle Scholar
  22. Sham Kakade, Michael Kearns, Yishay Mansour, and Luis Ortiz. Competitive algorithms for vwap and limit order trading. In In the Proceedings of the ACM Electronic Commerce Conference, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Sham M. Kakade and Michael Kearns. Trading in markovian price models. Unpublished manuscript, 2005.Google ScholarGoogle Scholar
  24. Adam Kalai and Santosh Vempala. Efficient algorithms for universal portfolios. In IEEE Symposium on Foundations of Computer Science, pages 486--491, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. E. Lehrer. A wide range no-regret theorem. Games and Economic Behavior, 42:101--115, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  26. Nick Littlestone and Manfred K. Warmuth. The weighted majority algorithm. Information and Computation, 108:212--261, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Robert C. Merton. Theory of rational option pricing. Bell Journal of Economics and Management Science, 4(1):141--183, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  28. Per Aslak Mykland. Conservative delta hedging. The Annals of Applied Probability, 10(2):664--683, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  29. Jun Pan. The jump-risk premia implicit in options: Evidence from an integrated time-series study. Journal of Financial Economics, 63:3--50, 2002.Google ScholarGoogle ScholarCross RefCross Ref
  30. P. Raghavan. A statistical adversary for online algorithms. DIMACS Series, 7:79--83, 1992.Google ScholarGoogle ScholarCross RefCross Ref
  31. Steven E. Shreve, N. El Karoui, and M. Jeanblanc-Picque. Robustness of the black and scholes formula. Mathematical Finance, 8:93--126, 1998.Google ScholarGoogle ScholarCross RefCross Ref
  32. Yoram Singer. Switching portfolios. pages 488--495.Google ScholarGoogle Scholar
  33. V. Vovk and C. Watkins. Universal portfolio selection. In COLT: Proceedings of the Workshop on Computational Learning Theory, Morgan Kaufmann Publishers, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Online trading algorithms and robust option pricing

        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 Conferences
          STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing
          May 2006
          786 pages
          ISBN:1595931341
          DOI:10.1145/1132516

          Copyright © 2006 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: 21 May 2006

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          Overall Acceptance Rate1,469of4,586submissions,32%

          Upcoming Conference

          STOC '24
          56th Annual ACM Symposium on Theory of Computing (STOC 2024)
          June 24 - 28, 2024
          Vancouver , BC , Canada

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader