Predictive Complexity and Generalized Entropy Rate of Stationary Ergodic Processes

DOI10.1007/978-3-642-34106-9_29zbMath1386.68077arXiv1205.2996OpenAlexW3101494096MaRDI QIDQ3164833

Mrinalkanti Ghosh, Satyadev Nandakumar

Publication date: 16 October 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.2996

Mathematics Subject Classification ID

Inference from stochastic processes and prediction (62M20) Computational learning theory (68Q32) Stationary stochastic processes (60G10) Applications of game theory (91A80) Other game-theoretic models (91A40) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Measures of information, entropy (94A17) Statistical aspects of information-theoretic topics (62B10)

Related Items (1)

Predictive Complexity for Games with Finite Outcome Spaces

This page was built for publication: Predictive Complexity and Generalized Entropy Rate of Stationary Ergodic Processes