{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T09:13:24Z","timestamp":1649063604439},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2005,8,1]],"date-time":"2005-08-01T00:00:00Z","timestamp":1122854400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":2907,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2005,8]]},"DOI":"10.1016\/j.ic.2005.04.001","type":"journal-article","created":{"date-parts":[[2005,7,6]],"date-time":"2005-07-06T18:02:27Z","timestamp":1120672947000},"page":"55-71","source":"Crossref","is-referenced-by-count":2,"title":["How many strings are easy to predict?"],"prefix":"10.1016","volume":"201","author":[{"given":"Yuri","family":"Kalnishkan","sequence":"first","affiliation":[]},{"given":"Vladimir","family":"Vovk","sequence":"additional","affiliation":[]},{"given":"Michael V.","family":"Vyugin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.ic.2005.04.001_bib1","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1145\/258128.258179","article-title":"How to use expert advice","volume":"44","author":"Cesa-Bianchi","year":"1997","journal-title":"Journal of the ACM"},{"key":"10.1016\/j.ic.2005.04.001_bib2","series-title":"Convexity","author":"Eggleston","year":"1958"},{"issue":"5","key":"10.1016\/j.ic.2005.04.001_bib3","doi-asserted-by":"crossref","first-page":"1906","DOI":"10.1109\/18.705569","article-title":"Sequential prediction of individual sequences under general loss functions","volume":"44","author":"Haussler","year":"1998","journal-title":"IEEE Transactions on Information Theory"},{"issue":"301","key":"10.1016\/j.ic.2005.04.001_bib4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","article-title":"Probability inequalities for sums of bounded random variables","volume":"58","author":"Hoeffding","year":"1963","journal-title":"Journal of the American Statistical Association"},{"key":"10.1016\/j.ic.2005.04.001_bib5","series-title":"A first course in stochastic processes","author":"Karlin","year":"1975"},{"key":"10.1016\/j.ic.2005.04.001_bib6","doi-asserted-by":"crossref","unstructured":"Y. Kalnishkan, V. Vovk, M.V. Vyugin, A criterion for the existence of predictive complexity for binary games, in: Proceedings of the 15th International Conference on Algorithmic Learning Theory, ALT 2004, Lecture Notes in Artificial Intelligence, vol. 3244, Springer, Berlin, 2004, pp. 249\u2013263.","DOI":"10.1007\/978-3-540-30215-5_20"},{"key":"10.1016\/j.ic.2005.04.001_bib7","series-title":"An introduction to Kolmogorov complexity and its applications","author":"Li","year":"1997"},{"key":"10.1016\/j.ic.2005.04.001_bib8","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1006\/inco.1994.1009","article-title":"The weighted majority algorithm","volume":"108","author":"Littlestone","year":"1994","journal-title":"Information and Computation"},{"key":"10.1016\/j.ic.2005.04.001_bib9","doi-asserted-by":"crossref","unstructured":"V. Vovk, C.J.H.C. Watkins. Universal portfolio selection, in: Proceedings of the 11th Annual Conference on Computational Learning Theory, 1998, pp. 12\u201323.","DOI":"10.1145\/279943.279947"},{"key":"10.1016\/j.ic.2005.04.001_bib10","first-page":"357","article-title":"Algorithmic entropy (complexity) of finite objects and its applications to defining randomness and amount of information","volume":"13","author":"V\u2019yugin","year":"1994","journal-title":"Selecta Mathematica formerly Sovietica"},{"key":"10.1016\/j.ic.2005.04.001_bib11","series-title":"Probability with Martingales","author":"Williams","year":"1991"},{"key":"10.1016\/j.ic.2005.04.001_bib12","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","article-title":"The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms","volume":"25","author":"Zvonkin","year":"1970","journal-title":"Russian Mathematical Surveys"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540105000751?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540105000751?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T05:36:25Z","timestamp":1551764185000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540105000751"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,8]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,8]]}},"alternative-id":["S0890540105000751"],"URL":"https:\/\/doi.org\/10.1016\/j.ic.2005.04.001","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2005,8]]}}}