{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:16:13Z","timestamp":1775013373586,"version":"3.50.1"},"reference-count":19,"publisher":"Pleiades Publishing Ltd","issue":"2","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Probl Inf Transm"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1134\/s0032946011020074","type":"journal-article","created":{"date-parts":[[2011,7,12]],"date-time":"2011-07-12T22:10:50Z","timestamp":1310508650000},"page":"166-189","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On universal algorithms for adaptive forecasting"],"prefix":"10.1134","volume":"47","author":[{"given":"V. V.","family":"V\u2019yugin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2011,7,14]]},"reference":[{"key":"4108_CR1","series-title":"Lect. Notes Comp. Sci.","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/978-3-540-79709-8_31","volume-title":"Computer Science-Theory and Applications (Proc. 3rd Int. Computer Science Sympos. in Russia [CSR\u20192008], Moscow, Russia, 2008)","author":"V.V. V\u2019yugin","year":"2008","unstructured":"V\u2019yugin V.V. On Sequences with Non-learnable Subsequences, Computer Science-Theory and Applications (Proc. 3rd Int. Computer Science Sympos. in Russia [CSR\u20192008], Moscow, Russia, 2008), Hirsh, E., Razborov, A., Semenov, A., and Slissenko, A., Eds., Lect. Notes Comp. Sci., vol. 5010, Berlin: Springer, 2008, pp. 302\u2013313."},{"issue":"379","key":"4108_CR2","doi-asserted-by":"publisher","first-page":"605","DOI":"10.2307\/2287720","volume":"77","author":"A.P. Dawid","year":"1982","unstructured":"Dawid, A.P., TheWell-Calibrated Bayesian, J. Amer. Statist. Assoc., 1982, vol. 77, no. 379, pp. 605\u2013613.","journal-title":"J. Amer. Statist. Assoc."},{"issue":"2","key":"4108_CR3","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1093\/biomet\/85.2.379","volume":"85","author":"D.P. Foster","year":"1998","unstructured":"Foster, D.P. and Vohra, R.V., Asymptotic Calibration, Biometrika, 1998, vol. 85, no. 2, pp. 379\u2013390.","journal-title":"Biometrika"},{"issue":"1","key":"4108_CR4","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s001820300153","volume":"32","author":"A. Sandroni","year":"2003","unstructured":"Sandroni, A., The Reproducible Properties of Correct Forecasts, Int. J. Game Theory, 2003, vol. 32, no. 1, pp. 151\u2013159.","journal-title":"Int. J. Game Theory"},{"issue":"4","key":"4108_CR5","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1111\/j.1467-937X.2006.00401.x","volume":"73","author":"E. Dekel","year":"2006","unstructured":"Dekel, E. and Feinberg, Y., Non-Bayesian Testing of a Stochastic Prediction, Rev. Econom. Stud., 2006, vol. 73, no. 4, pp. 893\u2013906.","journal-title":"Rev. Econom. Stud."},{"issue":"1","key":"4108_CR6","doi-asserted-by":"publisher","first-page":"93","DOI":"10.3982\/ECTA7163","volume":"77","author":"L. Fortnow","year":"2009","unstructured":"Fortnow, L. and Vohra, R.V., The Complexity of Forecast Testing, Econometrica, 2009, vol. 77, no. 1, pp. 93\u2013105.","journal-title":"Econometrica"},{"issue":"4","key":"4108_CR7","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.1214\/aos\/1176349736","volume":"13","author":"A.P. Dawid","year":"1985","unstructured":"Dawid, A.P., Calibration-Based Empirical Probability, Ann. Statist., 1985, vol. 13,no. 4, pp. 1251\u20131285.","journal-title":"Ann. Statist."},{"issue":"1","key":"4108_CR8","first-page":"105","volume":"45","author":"V.A. Uspensky","year":"1990","unstructured":"Uspensky, V.A., Semenov, A.L., and Shen\u2019, A.Kh., Can an Individual Sequence of Zeros and Ones Be Random?, Uspekhi Mat. Nauk, 1990, vol. 45, no. 1, pp. 105\u2013162 [Russian Math. Surveys (Engl. Transl.), 1990, vol. 45, no. 1, pp. 121\u2013189].","journal-title":"Uspekhi Mat. Nauk"},{"key":"4108_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M. Li","year":"1997","unstructured":"Li, M. and Vit\u00e1nyi, P., An Introduction to Kolmogorov Complexity and Its Applications, New York: Springer, 1997, 2nd ed.","edition":"2nd ed."},{"issue":"390","key":"4108_CR10","doi-asserted-by":"publisher","first-page":"339","DOI":"10.2307\/2287891","volume":"80","author":"D. Oakes","year":"1985","unstructured":"Oakes, D., Self-Calibrating Priors Do Not Exist, J. Amer. Statist. Assoc., 1985, vol. 80, no. 390, pp. 339\u2013342.","journal-title":"J. Amer. Statist. Assoc."},{"issue":"1","key":"4108_CR11","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1287\/moor.28.1.141.14264","volume":"28","author":"A. Sandroni","year":"2003","unstructured":"Sandroni, A., Smorodinsky, R., and Vohra, R.V., Calibration with Many Checking Rules, Math. Oper. Res., 2003, vol. 28, no. 1, pp. 141\u2013153.","journal-title":"Math. Oper. Res."},{"key":"4108_CR12","volume-title":"Veroyatnost\u2019","author":"A.N. Shiryaev","year":"1980","unstructured":"Shiryaev, A.N., Veroyatnost\u2019, Moscow: Nauka, 1980. Translated under the title Probability, New York: Springer, 1984."},{"key":"4108_CR13","series-title":"Lect. Notes Comp. Sci.","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/978-3-540-27819-1_3","volume-title":"Proc. 17th Ann. Conf. on Learning Theory (COLT\u20192004), Banff, Canada, 2004","author":"S. Kakade","year":"2004","unstructured":"Kakade, S. and Foster, D.P., Deterministic Calibration and Nash Equilibrium, Proc. 17th Ann. Conf. on Learning Theory (COLT\u20192004), Banff, Canada, 2004, Shawe-Taylor, J. and Singer, Y., Eds., Lect. Notes Comp. Sci., vol. 3120, Berlin: Springer, 2004, pp. 33\u201348."},{"issue":"5","key":"4108_CR14","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1111\/1468-0262.00244","volume":"69","author":"E. Lehrer","year":"2001","unstructured":"Lehrer, E., Any Inspection Rule Is Manipulable, Econometrica, 2001, vol. 69, no. 5, pp. 1333\u20131347.","journal-title":"Econometrica"},{"key":"4108_CR15","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"Rogers, H., Theory of Recursive Functions and Effective Computability, New York: McGraw-Hill, 1967. Translated under the title Teoriya rekursivnykh funktsii i effektivnaya vychislimost\u2019, Moscow: Mir, 1972."},{"issue":"6","key":"4108_CR16","first-page":"85","volume":"25","author":"A.K. Zvonkin","year":"1970","unstructured":"Zvonkin, A.K. and Levin, L.A., Complexity of Finite Objects and the Algorithmic Concepts of Information and Randomness, Uspekhi Mat. Nauk, 1970, vol. 25, no. 6, pp. 85\u2013127 [Russian Math. Surveys (Engl. Transl.), 1970, vol. 25, no. 6, pp. 83\u2013124].","journal-title":"Uspekhi Mat. Nauk"},{"issue":"2","key":"4108_CR17","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0304-3975(98)00073-5","volume":"207","author":"V.V. V\u2019yugin","year":"1998","unstructured":"V\u2019yugin, V.V., Non-Stochastic Infinite and Finite Sequences, Theoret. Comput. Sci., 1998, vol. 207, no. 2, pp. 363\u2013382.","journal-title":"Theoret. Comput. Sci."},{"key":"4108_CR18","unstructured":"Vovk, V., Defensive Forecasting for Optimal Prediction with Expert Advice, arXiv e-print 0708.1503v1, 2007."},{"key":"4108_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921","volume-title":"Prediction, Learning, and Games","author":"N. Cesa-Bianchi","year":"2006","unstructured":"Cesa-Bianchi, N. and Lugosi, G., Prediction, Learning, and Games, Cambridge: Cambridge Univ. Press, 2006."}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946011020074.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946011020074","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946011020074","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946011020074.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:07:36Z","timestamp":1775009256000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946011020074"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["4108"],"URL":"https:\/\/doi.org\/10.1134\/s0032946011020074","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6]]},"assertion":[{"value":"6 November 2008","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2011","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2011","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}