The Cost of Achieving the Best Portfolio in Hindsight

Published Online:https://doi.org/10.1287/moor.23.4.960

References

  • Blackwell D. Controlled random walks. Proc. Internat. Congress of Math. (1956a) III Amsterdam, North Holland 336 338 Google Scholar
  • Blackwell D. An analog of the minimax theorem for vector payoffs. Pacific J. Math. (1956b) 6 CrossrefGoogle Scholar
  • Cover T. M. Universal portfolios. Math. Finance (1991) 1 1 1 29 CrossrefGoogle Scholar
  • Cover T. M. , Gluss D. Empirical Bayes stock market portfolios. Adv. Appl. Math. (1986) 7 170 181 CrossrefGoogle Scholar
  • Cover T. M. , Ordentlich E. Universal portfolios with side information. IEEE Trans. Inform. Theory (1996) 42 2 CrossrefGoogle Scholar
  • Cox J. , Huang C. A continuous time portfolio turnpike theorem. J. Econom. Dynam. Control (1992) 16 491 501 CrossrefGoogle Scholar
  • Duffie D. Dynamic Asset Pricing Theory (1996) 2nd ed. (Princeton University Press, Princeton, New Jersey) Google Scholar
  • Huberman G. , Ross S. Portfolio turnpike theorem, risk aversion, and regularly varying functions. Econometrica (1983) 51 CrossrefGoogle Scholar
  • Jamshidian F. Asymptotically optimal portfolios. Math. Finance (1992) 2 2 CrossrefGoogle Scholar
  • Karatzas I. , Shreve S. E. Brownian Motion and Stochastic Calculus (1991) 2nd ed. (Springer-Verlag) . Graduate Texts in Mathematics Google Scholar
  • Karlin S. Private communication. (1996) Google Scholar
  • Kløve T. Bounds for the worst case probability of undetected error. IEEE Trans. Inform. Theory (1995) 41 1 CrossrefGoogle Scholar
  • Larson D. C. Growth optimal trading strategies (1986) . Ph.D. thesis, Stanford University, Stanford, California Google Scholar
  • Marshall A. W. , Olkin I. Inequalities: Theory of Majorization and Its Applications (1979) 143 (Academic Press, London) . Mathematics in Science and Engineering Google Scholar
  • Massey J. Coding techniques for digital networks. Proc. Internat. Conf. on Inform. Theory Systems (1978) Berlin, Germany Google Scholar
  • Merhav N. , Feder M. Universal schemes for sequential decision from individual data sequences. IEEE Trans. Inform. Theory (1993) 39 4 1280 1292 CrossrefGoogle Scholar
  • Ordentlich E. Universal investment and universal data compression (1996) . Ph.D. thesis, Stanford University, Stanford, California Google Scholar
  • Ordentlich E. , Cover T. M. On-line portfolio selection. Proc. Ninth Conf. on Computational Learn. Theory (1996) Desenzano del Garda, Italy CrossrefGoogle Scholar
  • Rudin W. Principles of Mathematical Analysis 3rd ed. (McGraw-Hill) Google Scholar
  • Shtarkov Yu. M. Universal sequential coding of single messages. Problems of Inform. Transmission (1987) 23 3 3 17 Google Scholar
  • Shtarkov Yu. M. , Tjalkens T. , Willems F. M. Multi-alphabet universal coding of memoryless sources. Problems of Inform. Transmission (1995) 31 114 127 Google Scholar
  • Szpankowski W. On asymptotics of certain sums arising in coding theory. IEEE Trans. Inform. Theory (1995) 41 6 CrossrefGoogle Scholar
  • Szpankowski W. Some new sums arising in coding theory. (1996) . Preprint Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.