Proceedings 41st Annual Symposium on Foundations of Computer Science (2000)

Redondo Beach, California

Nov. 12, 2000 to Nov. 14, 2000

ISSN: 0272-5428

ISBN: 0-7695-0850-2

pp: 486

ABSTRACT

A constant rebalanced portfolio is an investment strategy which keeps the same distribution of wealth among a set of stocks from day to day. There has been much work on Cover's Universal algorithm, which is competitive with the best constant rebalanced portfolio determined in hindsight (D. Helmbold et al., 1995; A. Blum and A. Kalai, 1999; T.M. Cover and E. Ordentlich, 1996). While this algorithm has good performance guarantees, all known implementations are exponential in the number of stocks, restricting the number of stocks used in experiments. We present an efficient implementation of the Universal algorithm that is based on non-uniform random walks that are rapidly mixing (D. Applegate and R. Kannanm, 1991). This same implementation also works for non-financial applications of the Universal algorithm, such as data compression (T.M. Cover, 1886) and language modeling (A. Kalai et al., 1999).

INDEX TERMS

stock markets; competitive algorithms; investment; data compression; universal portfolios; constant rebalanced portfolio; investment strategy; wealth; best constant rebalanced portfolio; performance guarantees; Universal algorithm; non-uniform random walks; non-financial applications; data compression; language modelin; competitive algorithm

CITATION

A. Kalai and S. Vempala, "Efficient algorithms for universal portfolios,"

*Proceedings 41st Annual Symposium on Foundations of Computer Science(FOCS)*, Redondo Beach, California, 2000, pp. 486.

doi:10.1109/SFCS.2000.892136

CITATIONS