Universal portfolios with side information
نویسندگان
چکیده
We present a sequential investment algorithm, the -weighted universal portfolio with side-information, which achieves, to rst order in the exponent, the same wealth as the best side-information dependent investment strategy (the best state-constant rebalanced portfolio) determined in hindsight from observed market and side-information outcomes. This is an individual sequence result which shows that the di erence between the exponential growth rates of wealth of the best state-constant rebalanced portfolio and the universal portfolio with side-information is uniformly less than (d=(2n)) log(n + 1) + (k=n) log 2 for every stock market and side-information sequence and for all time n. Here d = k(m 1) is the number of degrees of freedom in the state-constant rebalanced portfolio with k states of side-information and m stocks. The proof of this result establishes a close connection between universal investment and universal data compression.
منابع مشابه
Universal Portfolios with Side Information 6.975
The general investment problem concerns the allocation of wealth among m assets (stocks) to generate high returns with low risk or uncertainty. Cover and Ordentlich consider this problem from an information theoretic perspective in the case where a side information sequence aids the investment decisions but no assumptions are made on the relative likelihoods (probabilities) of stock returns seq...
متن کاملEfficient Universal Portfolios for Past-dependent Target Classes
We present a new universal portfolio algorithm that achieves almost the same level of wealth as could be achieved by knowing stock prices ahead of time. Specifically the algorithm tracks the best in hindsight wealth achievable within target classes of linearly parameterized portfolio sequences. The target classes considered are more general than the standard constant rebalanced portfolio class ...
متن کاملOn Asymptotics of Certain Recurrences Arising in Universal Coding
Ramanujan's Q-function, Lambert W-function, and the so called \tree function" T(z) deened implicitly by the equation T(z) = ze T(z) found applications in hashing, the birthday paradox problem, random mappings, caching, memory connicts, and so forth. Recently, several novel applications of these functions to information theory problems such as linear coding and universal portfolios were brought ...
متن کاملOn asymptotics of Certain Recurrences Arising in Multi-Alphabet Universal Coding
Ramanujan's Q-function and the so called "tree function" T(z) defined implicitly by the equation T(z) = zeT(z) found applications in hashing, the birthday paradox problem, random mappings, caching, memory conflicts, and so forth. Recently, several novel applications of these functions to information theory problems such as linear coding and universal portfolios were brought to light. In this pa...
متن کاملOn Asymptotics of Certain Recurrences Arising
Ramanujan's Q-function and the so called \tree function" T(z) deened implicitly by the equation T(z) = ze T(z) found applications in hashing, the birthday paradox problem, random mappings, caching, memory connicts, and so forth. Recently, several novel applications of these functions to information theory problems such as linear coding and universal portfolios were brought to light. In this pap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 42 شماره
صفحات -
تاریخ انتشار 1996