Predictive Complexity for Games with Finite Outcome Spaces

DOI10.1007/978-3-319-21852-6_8MaRDI QIDQ2805719zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1966614
• Algorithmic Learning Theory
• Mathematical Foundations of Computer Science 2005
• The complexity of ergodic mean-payoff games
• The complexity of stochastic games
• Finite complexity and the folk theorem in repeated games
• The complexity of mean payoff games
• scientific article; zbMATH DE number 1342211

Cites work

• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• scientific article; zbMATH DE number 3090557 (Why is no real title available?)
• An introduction to Kolmogorov complexity and its applications
• Convex Analysis
• General linear relations between different types of predictive complexity
• Generalised entropies and asymptotic complexities of languages
• How many strings are easy to predict?
• Loss functions, complexities, and the Legendre transformation.
• On complexity of easy predictable sequences
• Prediction, Learning, and Games
• Predictive complexity and generalized entropy rate of stationary ergodic processes
• Predictive complexity and information
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• The weak aggregating algorithm and weak mixability

Cited in

(7)

• Predictive complexity and generalized entropy rate of stationary ergodic processes
• Finite-time 4-expert prediction problem
• An axiomatic approach to predictability of outcomes in an interactive setting
• Algorithmic Learning Theory
• Suboptimal measures of predictive complexity for absolute loss function
• scientific article; zbMATH DE number 2089357 (Why is no real title available?)
• scientific article; zbMATH DE number 1966614 (Why is no real title available?)

This page was built for publication: Predictive Complexity for Games with Finite Outcome Spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805719)