S. Arimoto, An algorithm for computing the capacity of arbitrary discrete memoryless channels, IEEE Transactions on Information Theory, vol.18, issue.1, pp.14-20, 1972.
DOI : 10.1109/TIT.1972.1054753

Q. Xie and A. Barron, Asymptotic minimax regret for data compression, gambling, andprediction, IEEE Transactions on Information Theory, vol.46, issue.2, pp.431-445

D. Blackwell and L. Dubins, Merging of Opinions with Increasing Information, The Annals of Mathematical Statistics, vol.33, issue.3, pp.882-887, 1962.
DOI : 10.1214/aoms/1177704456

R. Blahut, Computation of channel capacity and rate-distortion functions, IEEE Transactions on Information Theory, vol.18, issue.4, pp.460-473, 1972.
DOI : 10.1109/TIT.1972.1054855

R. Gallager, Source Coding With Side Information and Universal Coding, M.I.T. LIDS-P- 937, 1976.

D. Haussler, A general minimax result for relative entropy, IEEE Transactions on Information Theory, vol.43, issue.4, pp.1276-1280, 1997.
DOI : 10.1109/18.605594

M. Hutter, Towards a Universal Theory of Artificial Intelligence Based on Algorithmic Probability and Sequential Decisions, 2005.
DOI : 10.1007/3-540-44795-4_20

M. Jackson, E. Kalai, and R. Smorodinsky, Bayesian Representation of Stochastic Processes under Learning: de Finetti Revisited, Econometrica, vol.67, issue.4, pp.875-794, 1999.
DOI : 10.1111/1468-0262.00055

B. Ryabko, Coding of a source with unknown but ordered probabilities, Problems of Information Transmission, vol.15, issue.2, pp.134-138, 1979.

B. Ryabko, Prediction of random sequences and universal coding. Problems of Information Transmission, pp.87-96, 1988.

D. Ryabko, On sample complexity for computational classification problems, Algorithmica, pp.69-77, 2007.

D. Ryabko and M. Hutter, Predicting non-stationary processes, Applied Mathematics Letters, vol.21, issue.5, pp.477-482, 2008.
DOI : 10.1016/j.aml.2007.04.004

URL : https://hal.archives-ouvertes.fr/hal-00639573

. Yu and . Shtarkov, Universal sequential coding of single messages, Problems of Information Transmission, pp.3-17, 1988.

R. J. Solomonoff, Complexity-based induction systems: Comparisons and convergence theorems, IEEE Transactions on Information Theory, vol.24, issue.4, pp.24422-432, 1978.
DOI : 10.1109/TIT.1978.1055913

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.9141

V. Vapnik, Statistical Learning Theory, 1998.