Can we learn to beat the best stock

Journal of Artificial Intelligence Research

Volumn 21, Issue , 2004, Pages 579-594

  Borodin, Allan ^a   El Yaniv, Ran ^b   Gogan, Vincent ^a  

^a UNIVERSITY OF TORONTO   (Canada)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING SYSTEMS; STATISTICAL METHODS;

"UNIVERSAL" ALGORITHMS; STATISTICAL RELATIONS;

ALGORITHMS;

EID: 27344453239     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1336     Document Type: Review

References (20)

1. Blum, A., & Kalai, A. (1998). Universal portfolios with and without transaction costs. Machine Learning, 50(1), 23-30.
2. Borodin, A., & El-Yaniv, R. (1998). Online Computation and Competitive Analysis. Cambridge University Press.
3. Borodin, A., El-Yaniv, R., & Gogan, V. (2000). On the competitive theory and practice of portfolio selection. In Proc. of the 4th Latin American Symposium on Theoretical Informatics (LATIN'00), pp. 173-196.
4. Brock, L., Lakonishok, J., & LeBaron, B. (1992). Simple technical trading rules and the stochastic properties of stock returns. Journal of Finance, 47, 1731-1764.
5. Cesa-Bianchi, N., Freund, Y., Haussler, D., Helmbold, D., Schapire, R., & Warmuth, M. (1997). How to use expert advice. Journal of the ACM, 44(3), 427-485.
6. Chou, A., Cooperstock, J., El-Yaniv, R., Klugerman, M., & Leighton, T. (1995). The statistical adversary allows optimal money-making trading strategies. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms.
7. Cover, T. (1991). Universal portfolios. Mathematical Finance, 1, 1-29.
8. Cover, T., & Gluss, D. (1986). Empirical bayes stock market portfolios. Advances in Applied Mathematics, 7, 170-181.
9. Cover, T., & Ordentlich, E. (1996). Universal portfolios with side information. IEEE Transactions on Information Theory, 42(2), 348-363.
10. Cover, T., & Thomas, J. (1991). Elements of Information Theory. John Wiley & Sons, Inc.
11. Feder, M. (1991). Gambling using a finite state machine. IEEE Transactions on Information Theory, 37, 1459-1465.
12. Helmbold, D., Schapire, R., Singer, Y., & Warmuth, M. (1998). Portfolio selection using multiplicative updates. Mathematical Finance, 8(4), 325-347.
13. Langdon, G. (1983). A note on the Lempel-Ziv model for compressing individual sequences. IEEE Transactions on Information Theory, 29, 284-287.
14. Lo, A., & MacKinlay, C. (1999). A Non-Random Walk Down Wall Street. Princeton University Press.
15. Lugosi, G. (2001). Lectures on prediction of individual sequences. URL:http://www.econ.upf.es/~lugosi/ihp.ps.
16. Markowitz, H. (1959). Portfolio Selection: Efficient Diversification of Investments. John Wiley and Sons.
17. Raghavan, P. (1992). A statistical adversary for on-line algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 7, 79-83.
18. Rissanen, J. (1983). A universal data compression system. IEEE Transactions on Information Theory, 29, 656-664.
19. Sharpe, W. (1975). Adjusting for risk in portfolio performance measurement. Journal of Portfolio Management, 29-34. Winter.
20. Ziv, J., & Lempel, A. (1978). Compression of individual sequences via variable rate coding. IEEE Transactions on Information Theory, 24, 530-536.