Skip to main content

Competitive Analysis of On-line Securities Investment

  • 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:

Abstract

Based on the unidirectional conversion model, we investigate a practical buy-and-hold trading problem. This problem is useful for long-term investors, we use competitive analysis and game theory to design some trading rules in the securities markets. We present an online algorithm, Mixed Strategy, for the problem and prove its competitive ratio \(1 + \frac{(n-1)t}{2}\), where n is the trading horizon and t is the daily fluctuations of securities prices. The Dynamic-Mixed Strategy is also presented to further reduce the competitive ratio. An investing example is simulated with the Mixed Strategy and Dollar Average Strategy based on the actual market data.

Supported by NSF Grant No.70471035 and No.10371094.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press, Cambridge (1998)

    MATH  Google Scholar 

  2. Sleator, D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28, 202–208 (1985)

    Article  MathSciNet  Google Scholar 

  3. Cover, T.M.: Universal Portfolio. Mathematics Finance 1(1), 1–29 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  4. El-Yaniv, R.: Competitive Solutions for Online Financial Problems. ACM Computing Surveys 30, 28–68 (1998)

    Article  Google Scholar 

  5. El-Yaniv, R., Fiat, A., Karp, R.M., Turpin, G.: Competitive Analysis of Financial Games. In: Proc. 33rd Annual Symposium on Foundations of Computer Science, pp. 327–333 (1992)

    Google Scholar 

  6. El-Yaniv, R., Fiat, A., Karp, R.M., Turpin, G.: Optimal Search and One-way Trading Online Algorithms. Algorithmica 30, 101–139 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  7. Zhijun, Z., Yinfeng, X., Jinhu, J.: Competitive Analysis of One-way Trading with Interest and Transaction Cost. Forecasting 22(4), 51–56 (2003)

    Google Scholar 

  8. Chou, A., Cooperstock, J.R., El-Yaniv, R., Kugerman, M., Leighton, T.: The Statistical Adversary Allows Optimal Money-making Trading Strategies. In: The Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (1995)

    Google Scholar 

  9. Chen, G.-H., Kao, M.-Y., Yuh-Dauhlyuu, Wong, H.-k.: Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns. SIAM J., COMPUT. 31, 447–459 (2000)

    Article  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

Hu, S., Guo, Q., Li, H. (2005). Competitive Analysis of On-line Securities Investment. 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_25

Download citation

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

  • 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