ALT 2010: Algorithmic Learning Theory pp 239-254 | Cite as
Switching Investments
Abstract
We present a simple online two-way trading algorithm that exploits fluctuations in the unit price of an asset. Rather than analysing worst-case performance under some assumptions, we prove a novel, unconditional performance bound that is parameterised either by the actual dynamics of the price of the asset, or by a simplifying model thereof. The algorithm processes T prices in O(T 2) time and O(T) space, but if the employed prior density is exponential, the time requirement reduces to O(T). The result translates to the prediction with expert advice framework, and has applications in data compression and hypothesis testing.
Keywords
Asset Price Online Algorithm Local Extremum Bank Account Expert AdvicePreview
Unable to display preview. Download preview PDF.
References
- 1.Berger, J.O.: Could Fisher, Jeffreys and Neyman have agreed on testing? Statistical Science 18(1), 1–32 (2003)MATHCrossRefMathSciNetGoogle Scholar
- 2.Chen, G.H., Kao, M.Y., Lyuu, Y.D., Wong, H.K.: Optimal buy-and-hold strategies for financial markets with bounded daily returns. In: Proc. of the 31st Annual ACM Symposium on Theory of Computing, pp. 119–128. ACM, New York (1999)Google Scholar
- 3.Cover, T.M., Thomas, J.A.: Elements of Information Theory. John Wiley, Chichester (1991)MATHCrossRefGoogle Scholar
- 4.Dannoura, E., Sakurai, K.: An improvement on El-Yaniv-Fiat-Karp-Turpin’s money-making bi-directional trading strategy. IPL 66(1), 27–33 (1998)MATHCrossRefMathSciNetGoogle Scholar
- 5.Dawid, A.P., De Rooij, S., Shafer, G., Shen, A., Vereshchagin, N., Vovk, V.: Insuring against loss of evidence in game-theoretic probability, arXiv:1005.1811Google Scholar
- 6.DeMarzo, P., Kremer, I., Mansour, Y.: Online trading algorithms and robust option pricing. In: Proc. of the 38 Annual ACM Symposium on Theory of Computing, pp. 477–486. ACM, New York (2006)Google Scholar
- 7.El-Yaniv, R., Fiat, A., Karp, R.M., Turpin, G.: Optimal search and one-way trading online algorithms. Algorithmica 30(1), 101–139 (2001)MATHCrossRefMathSciNetGoogle Scholar
- 8.Van Erven, T., Grünwald, P.D., De Rooij, S.: Catching up faster by switching sooner: a prequential solution to the AIC-BIC dilemma (2008) (submitted); Preprint available as arXiv:0807.1005Google Scholar
- 9.Herbster, M., Warmuth, M.K.: Tracking the best expert. Machine Learning 32, 151–178 (1998)MATHCrossRefGoogle Scholar
- 10.Koolen, W.M., De Rooij, S.: Combining expert advice efficiently. In: Proc. of the 21st Annual Conference on Learning Theory, pp. 275–286 (2008)Google Scholar
- 11.Shafer, G., Shen, A., Vereshchagin, N., Vovk, V.: Test martingales, Bayes factors, and p-values, arXiv:0912.4269Google Scholar
- 12.Volf, P., Willems, F.: Switching between two universal source coding algorithms. In: Proc. of the Data Compression Conference, Snowbird, Utah, pp. 491–500. IEEE Computer Society Press, Los Alamitos (1998)Google Scholar
- 13.Vovk, V.: A game of prediction with expert advice. Journal of Computer and System Sciences 56, 153–173 (1998)MATHCrossRefMathSciNetGoogle Scholar