Predictive Complexity for Games with Finite Outcome Spaces

Predictive complexity is a generalisation of Kolmogorov complexity motivated by an on-line prediction scenario. It quantifies “unpredictability ” of a sequence in a particular prediction environment. This paper surveys key results on predictive complexity for games with finitely many outcomes. The issues of existence, non-existence, uniqueness, and linear inequalities are covered.