Abstract
A constant rebalanced portfolio is an investment strategy which keeps the same distribution of wealth among a set of stocks from period to period. Recently there has been work on on-line investment strategies that are competitive with the best constant rebalanced portfolio determined in hindsight (Cover, 1991, 1996; Helmbold et al., 1996; Cover & Ordentlich, 1996a, 1996b; Ordentlich & Cover, 1996). For the universal algorithm of Cover (Cover, 1991),we provide a simple analysis which naturallyextends to the case of a fixed percentage transaction cost (commission ), answering a question raised in (Cover, 1991; Helmbold et al., 1996; Cover & Ordentlich, 1996a, 1996b; Ordentlich & Cover, 1996; Cover, 1996). In addition, we present a simple randomized implementation that is significantly faster in practice. We conclude by explaining how these algorithms can be applied to other problems, such as combining the predictions of statistical language models, where the resulting guarantees are more striking.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Cesa-Bianchi, N., Freund, Y., Helmbold, D.P., Haussler, D., Schapire, R.E., & Warmuth, M.K. (1993). How to use expert advice. Annual ACM Symposium on Theory of Computing (pp. 382–391).
Cover, T.M. (1991). Universal portfolios. Math. Finance, 1(1), 1–29.
Cover, T.M. (1996). Universal data compression and portfolio selection. Proceedings of the 37th IEEE Symposium on Foundations of Computer Science (pp. 534–538).
Cover, T.M., & Ordentlich, E. (1996a). Universal portfolios with side information. IEEE Transactions on Information Theory, 42(2).
Cover, T.M., & Ordentlich, E. (1996b). The cost of achieving the best portfolio in hindsight. (Technical Report NSF-90). Department of Statistics, Stanford University.
Davis, M.H.A., & Norman, A.R. (1990). Portfolio selection with transaction costs. Mathematics of Operations Research, 15(4).
DeSantis, A., Markowsky, G., & Wegman, M. (1998). Learning probabilistic prediction functions. Proceedings of the 29th IEEE Symposium on Foundations of Computer Science (pp. 110–119).
Foster, D.P., & Vohra, R.V. (1993). A randomization rule for selecting forecasts. Operations Research, 41, 704–709.
Foster, D.P., & Vohra, R.V. (1995). Regret in the on-line decision problem. 'Something for Nothing' Workshop.
Haussler, D., Kivinen, J., & Warmuth, M. (1994). Tight worst-case loss bounds for predicting with expert advice. (Technical Report UCSC-CRL-94-36). University of California, Santa Cruz.
Helmbold, D., Schapire, R., Singer, Y., & Warmuth, M. (1995). A comparison of new and old algorithms for a mixture estimation problem. Proceedings of the Eighth Annual Workshop on Computational Learning Theory (pp. 69–78).
Helmbold, D., Schapire, R., Singer, Y., & Warmuth, M. (1996). On-line portfolio selection using multiplicative updates. Machine Learning: Proceedings of the Thirteenth International Conference.
Kelly, J. (1956). A new interpretation of information rate. Bell Sys. Tech. Journal, 35, 917–926.
Kivinen, J., & Warmuth, M. (1994). Exponentiated gradient versus gradient descent for linear predictors. (Technical Report UCSC-CRL-94-16). University of California, Santa Cruz.
Littlestone, N. (1989). Mistake bounds and logarithmic linear-threshold learning algorithms. (Technical Report UCSC-CRL-89-11). University of California, Santa Cruz.
Ordentlich, E., & Cover, T.M. (1996). Online portfolio selection. Proceedings of the 9th Annual Conference on Computational Learning Theory. Desenzano del Garda, Italy.
Vovk, V. (1990). Aggregating strategies. Proceedings of the Third Annual Workshop on Computational Learning Theory (pp. 371–383). Morgan Kaufmann.
Vovk, V.G. (1995). A game of prediction with expert advice. Proceedings of the 8th Annual Conference on Computational Learning Theory (pp. 51–60). New York, NY: ACM Press.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Blum, A., Kalai, A. Universal Portfolios With and Without Transaction Costs. Machine Learning 35, 193–205 (1999). https://doi.org/10.1023/A:1007530728748
Issue Date:
DOI: https://doi.org/10.1023/A:1007530728748