V. Vovk
- 1.A. Blum and A. Kalai. Universal portfolios with and without transaction costs. In Proceedings of the lOth Annual Conference on Computational Learning Theory, pages 309 313, New York, 1997. Assoc. Comput. Mach. Google Scholar
Digital Library
- 2.T. Cover and E. Ordentlich. Universal portfolios with side information. IEEE Trans. Inform. Theory, 42:348 363, 1996. Google ScholarDigital Library
- 3.M. Feder, N. Merhav, and M. Gutman. Universal prediction of individual sequences. IEEE Trans. Inform. Theory, 38:1258-1270, 1992.Google ScholarDigital Library
- 4.G. H. Hardy, J. E. Littlewood, and G. P61ya. Inequalities. Cambridge University Press, Cambridge, 1967.Google Scholar
- 5.D. Haussler, J. Kivinen, and M. K. Warmuth. Tight worst-case loss bounds for predicting with expert advice. Technical Report UCSC-CRL-94- 36, University of California at Santa Cruz, revised December 1994. Short version in P. Vit~nyi, editor, Computational Learning Theory, Lecture Notes in Computer Science, volume 904, pages 69- 83, Springer, Berlin, 1995. Google ScholarDigital Library
- 6.D. P. Helmbold, R. E. Schapire, Y. Singer, and M. K. Warmuth. On-line portfolio selection using multiplicative updates. In Proceedings of the 13th International Conference on Machine Learning, 1996.Google Scholar
- 7.M. Herbster and M. Warmuth. Tracking the best expert. In Proceedings of the 12th International Conference on Machine Learning, pages 286-294. Morgan Kaufmann, 1995.Google Scholar
- 8.J. Kivinen and M. K. Warmuth. Exponential Gradient versus Gradient Descent for linear predictors. Inform. Computation, 132:1-63, 1997. Google ScholarDigital Library
- 9.M. Li and P. VitAnyi. An Introduction to Kolmogorov Complexity and Its Applications. Springer, New York, 2nd edition, 1997. Google ScholarDigital Library
- 10.N. Littlestone, P. M. Long, and M. K. Warmuth. On-line learning of linear functions. J. Comput. Complexity, 5:1-23, 1995. Google ScholarDigital Library
- 11.N. Littlestone and M. K. Warmuth. The Weighted Majority Algorithm. Inform. Computation, 108:212-261, 1994. Google ScholarDigital Library
- 12.V. Vovk. Aggregating strategies. In M. Fulk and J. Case, editors, Proceedings of the 3rd Annual Workshop on Computational Learning Theory, pages 371-383, San Mateo, CA, 1990. Morgan Kaufmann. Google ScholarDigital Library
- 13.V. Vovk. Universal forecasting algorithms. Inform. Computation, 96:245-277, 1992. Google ScholarDigital Library
- 14.V. Vovk. A game of prediction with expert advice. In Proceedings, 8th Annual Conference on Computational Learning Theory, pages 51-60, New York, 1995. Assoc. Comput. Mach. To be published in J. Comput. Syst. Sci. Google ScholarDigital Library
- 15.V. Vovk. Derandomizing stochastic prediction strategies. In Proceedings of the lOth Annual Conference on Computational Learning Theory, pages 32-44, New York, 1997. Assoc. Comput. Mach. Google ScholarDigital Library
- 16.V. Vovk. Probability theory for the Brier game. Accepted for publication in Theoretical Computer Science, 1998. Preliminary version in M. Li and A. Maruoka, editors, Algorithmic Learning Theory, Lecture Notes in Computer Science, volume 1316, pages 323-338, 1997. Full version: Technical Report CSD-TR-97-09, Department of Computer Science, Royal Holloway, University of London, revised February 1998. Google ScholarDigital Library
- 17.A. K. Zvonkin and L. A. Levin. The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Math. Surveys, 25:83-124, 1970.Google ScholarCross Ref
Index Terms
- Universal portfolio selection
Recommendations
Systemic Risk-Driven Portfolio Selection
How can we construct portfolios that perform well in the face of systemic events? The global financial crisis of 2007–2008 and the coronavirus disease 2019 pandemic have highlighted the importance of accounting for extreme form of risks. In “Systemic Risk-...
We consider an investor who trades off tail risk and expected growth of the investment. We measure tail risk through the portfolio’s expected losses conditioned on the occurrence of a systemic event: financial market loss being exactly at, or at least at, ...
Universal data compression and portfolio selection
FOCS '96: Proceedings of the 37th Annual Symposium on Foundations of Computer ScienceThe authors consider universal data compression, universal portfolio selection (online portfolio algorithms) and the relationship of both to information theory. Apparently the fundamental minimax redundancy game in data compression and the minimax ...
Portfolio Selection Factors: Egypt Equity Market Case Study
ICSIE '19: Proceedings of the 8th International Conference on Software and Information EngineeringPortfolio management provides portfolio managers with the appropriate models for professional management of funds. The primary objectives for portfolio managers are to maximize the expected return of their investments while minimizing the associated ...
Comments