Universal Schemes for Prediction, Gambling and Portfolio Selection
Data up to Jan 2025
Total Citations Per Year
Abstract
References (20)
Elements of Information Theory
2001 • 38,276 citations
Compression of individual sequences via variable-rate coding
1978 • 3,451 citations
A New Interpretation of Information Rate
1956 • 1,535 citations
Arithmetic Coding
1979 • 724 citations
THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
1970 • 685 citations
A universal data compression system
1983 • 651 citations
Universal modeling and coding
1981 • 452 citations
Asymptotic Optimality and Asymptotic Equipartition Properties of Log-Optimum Investment
1988 • 359 citations
The Individual Ergodic Theorem of Information Theory
1957 • 276 citations
Source coding algorithms for fast data compression
1976 • 200 citations
A convergent gambling estimate of the entropy of English
1978 • 186 citations
A Sandwich Proof of the Shannon-McMillan-Breiman Theorem
1988 • 177 citations
The frequency goodness of fit test for probability chains
1951 • 161 citations
Competitive Optimality of Logarithmic Investment
1980 • 159 citations
Game-Theoretic Optimal Portfolios
1988 • 98 citations
A note on the Ziv - Lempel model for compressing individual sequences (Corresp.)
1983 • 81 citations
Guessing the next output of a stationary process
1978 • 71 citations
Universal Almost Sure Data Compression
1990 • 67 citations
Gambling using a finite state machine
1991 • 62 citations
Entropy and data compression
1970 • 31 citations