{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T18:41:49Z","timestamp":1774118509052,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"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":4125,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s0304-3975(01)00122-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:44:18Z","timestamp":1027626258000},"page":"407-415","source":"Crossref","is-referenced-by-count":5,"title":["Does snooping help?"],"prefix":"10.1016","volume":"276","author":[{"given":"V.V.","family":"V'yugin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00122-0_BIB1","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1214\/aop\/1176991250","article-title":"Kolmogorov's contributions to information theory and algorithmic complexity","volume":"17","author":"Cover","year":"1989","journal-title":"Ann. Probab."},{"issue":"5","key":"10.1016\/S0304-3975(01)00122-0_BIB2","doi-asserted-by":"crossref","first-page":"1906","DOI":"10.1109\/18.705569","article-title":"Tight worst-case loss bounds for predicting with expert advice","volume":"44","author":"Haussler","year":"1998","journal-title":"IEEE Trans. Inform. Theory IT"},{"key":"10.1016\/S0304-3975(01)00122-0_BIB3","series-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"Li","year":"1997"},{"key":"10.1016\/S0304-3975(01)00122-0_BIB4","first-page":"295","article-title":"The concept of (\u03b1,\u03b2)-stochasticity in the Kolmogorov sense and its properties","volume":"28","author":"Shen","year":"1983","journal-title":"Sov. Math. Dokl."},{"key":"10.1016\/S0304-3975(01)00122-0_BIB5","series-title":"Proc. of the Third Annu. Workshop on Computational Learning Theory, San Mateo, CA, 1990","first-page":"371","article-title":"Aggregating strategies","author":"Vovk","year":"1990"},{"key":"10.1016\/S0304-3975(01)00122-0_BIB6","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1006\/jcss.1997.1556","article-title":"A game of prediction with expert advice","volume":"56","author":"Vovk","year":"1998","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"10.1016\/S0304-3975(01)00122-0_BIB7","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1093\/comjnl\/42.4.318","article-title":"Complexity estimation principle","volume":"42","author":"Vovk","year":"1999","journal-title":"Comput. J."},{"key":"10.1016\/S0304-3975(01)00122-0_BIB8","doi-asserted-by":"crossref","unstructured":"V. Vovk, C.J.H.C. Watkins, Universal portfolio selection, Proc. of the 11th Annu. Conf. on Computational Learning Theory 1998, pp. 12\u201323.","DOI":"10.1145\/279943.279947"},{"key":"10.1016\/S0304-3975(01)00122-0_BIB9","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1137\/1132071","article-title":"On the defect of randomness of a finite object with respect to measures with given complexity bounds","volume":"32","author":"V'yugin","year":"1987","journal-title":"SIAM Theory Probab. Appl."},{"issue":"4","key":"10.1016\/S0304-3975(01)00122-0_BIB10","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1093\/comjnl\/42.4.294","article-title":"Algorithmic complexity and stochastic properties of finite binary sequences","volume":"42","author":"V'yugin","year":"1999","journal-title":"Comput. J."},{"key":"10.1016\/S0304-3975(01)00122-0_BIB11","series-title":"Proc. 8th Annual ACM Conf. on Computational Learning Theory","first-page":"83","article-title":"Randomized approximate aggregating strategies and their applications to prediction and discrimination","author":"Yamanishi","year":"1995"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501001220?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501001220?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T08:25:44Z","timestamp":1555921544000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501001220"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":11,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0304397501001220"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00122-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}