학술논문

Efficient algorithms for universal portfolios
Document Type
Conference
Source
Proceedings 41st Annual Symposium on Foundations of Computer Science Foundations of computer science Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on. :486-491 2000
Subject
Computing and Processing
Portfolios
Sampling methods
Computer science
Investments
Mathematics
Laboratories
Data compression
Engineering profession
Language
ISSN
0272-5428
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).