Predictive Complexity for Games with Finite Outcome Spaces [chapter]

Yuri Kalnishkan
2015 Measures of Complexity  
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.
doi:10.1007/978-3-319-21852-6_8 fatcat:f34xnbo6jzdztdj5d6cqlbqgsq