Predictive Complexity for Games with Finite Outcome Spaces

DOI10.1007/978-3-319-21852-6_8zbMath1357.68091OpenAlexW2297814864MaRDI QIDQ2805719

Yuri Kalnishkan

Publication date: 13 May 2016

Published in: Measures of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21852-6_8

Mathematics Subject Classification ID

Computational learning theory (68Q32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Rationality and learning in game theory (91A26)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The weak aggregating algorithm and weak mixability
• Loss functions, complexities, and the Legendre transformation.
• Predictive complexity and information
• On complexity of easy predictable sequences
• Generalised entropies and asymptotic complexities of languages
• How many strings are easy to predict?
• Predictive Complexity and Generalized Entropy Rate of Stationary Ergodic Processes
• Prediction, Learning, and Games
• Convex Analysis
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• An introduction to Kolmogorov complexity and its applications
• General linear relations between different types of predictive complexity