{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T06:29:23Z","timestamp":1742797763989,"version":"3.30.1"},"reference-count":24,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"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":4429,"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":[[2001,6]]},"DOI":"10.1016\/s0304-3975(00)00133-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:37:27Z","timestamp":1027622247000},"page":"57-79","source":"Crossref","is-referenced-by-count":6,"title":["Probability theory for the Brier game"],"prefix":"10.1016","volume":"261","author":[{"given":"V.","family":"Vovk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1979","series-title":"Probability and Measure","author":"Billingsley","key":"10.1016\/S0304-3975(00)00133-X_BIB1"},{"key":"10.1016\/S0304-3975(00)00133-X_BIB2","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1109\/72.501719","article-title":"Worst-case quadratic loss bounds for on-line prediction of linear functions by gradient descent","volume":"7","author":"Cesa-Bianchi","year":"1996","journal-title":"IEEE Trans. Neural Networks"},{"key":"10.1016\/S0304-3975(00)00133-X_BIB3","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1109\/18.485708","article-title":"Universal portfolios with side information","volume":"42","author":"Cover","year":"1996","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(00)00133-X_BIB4","doi-asserted-by":"crossref","first-page":"1251","DOI":"10.1214\/aos\/1176349736","article-title":"Calibration-based empirical probability (with discussion)","volume":"13","author":"Dawid","year":"1985","journal-title":"Annv. Statist."},{"key":"10.1016\/S0304-3975(00)00133-X_BIB5","first-page":"1","article-title":"Prequential probability: principles and properties","volume":"3","author":"Dawid","year":"1997","journal-title":"Bernoulli"},{"key":"10.1016\/S0304-3975(00)00133-X_BIB6","series-title":"Learning probabilistic prediction functions, Proc. 29th Annu. IEEE Symp. on Foundations of Computer Science","first-page":"110","author":"DeSantis","year":"1988"},{"key":"10.1016\/S0304-3975(00)00133-X_BIB7","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 Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(00)00133-X_BIB8","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1023\/A:1007424614876","article-title":"Tracking the best expert","volume":"32","author":"Herbster","year":"1998","journal-title":"Machine learning"},{"key":"10.1016\/S0304-3975(00)00133-X_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1996.2612","article-title":"Additive versus exponentiated gradient updates for linear prediction","volume":"132","author":"Kivinen","year":"1997","journal-title":"Inform. and Comput."},{"year":"1997","series-title":"Kolmogorov complexity","author":"Li","key":"10.1016\/S0304-3975(00)00133-X_BIB10"},{"key":"10.1016\/S0304-3975(00)00133-X_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01277953","article-title":"On-line learning of linear functions","volume":"5","author":"Littlestone","year":"1995","journal-title":"J. Comput. Complexity"},{"key":"10.1016\/S0304-3975(00)00133-X_BIB12","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":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00133-X_BIB13","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0168-0072(90)90029-2","article-title":"An extension of Borel determinacy","volume":"49","author":"Martin","year":"1990","journal-title":"Ann. Pure Appl. Logic"},{"year":"1996","series-title":"The Art of Causal Conjecture","author":"Shafer","key":"10.1016\/S0304-3975(00)00133-X_BIB14"},{"year":"1996","series-title":"Probability","author":"Shiryayev","key":"10.1016\/S0304-3975(00)00133-X_BIB15"},{"key":"10.1016\/S0304-3975(00)00133-X_BIB16","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1109\/TIT.1978.1055913","article-title":"Complexity-based induction systems: comparison and convergence theorems","volume":"IT-24","author":"Solomonoff","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(00)00133-X_BIB17","first-page":"656","article-title":"On a randomness criterion","volume":"35","author":"Vovk","year":"1987","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0304-3975(00)00133-X_BIB18","series-title":"Proc. 3rd Annu. Workshop on Computational Learning Theory","first-page":"371","article-title":"Aggregating strategies","author":"Vovk","year":"1990"},{"key":"10.1016\/S0304-3975(00)00133-X_BIB19","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1111\/j.2517-6161.1993.tb01904.x","article-title":"A logic of probability, with application to the foundations of statistics (with discussion)","volume":"55","author":"Vovk","year":"1993","journal-title":"J. Roy. Statist. Soc. B"},{"key":"10.1016\/S0304-3975(00)00133-X_BIB20","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. Computer System Sciences"},{"key":"10.1016\/S0304-3975(00)00133-X_BIB21","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1023\/A:1007595032382","article-title":"Derandomizing stochastic prediction strategies","volume":"35","author":"Vovk","year":"1999","journal-title":"Machine Learning"},{"key":"10.1016\/S0304-3975(00)00133-X_BIB22","series-title":"Advances in Neural Information Processing Systems","first-page":"364","article-title":"Competitive on-line linear regression","author":"Vovk","year":"1998"},{"year":"2000","series-title":"Predictive complexity, randomness and information, Technical Report CLRC-TR-00-06, Computer Learning Research Center","author":"Vovk","key":"10.1016\/S0304-3975(00)00133-X_BIB23"},{"year":"1991","series-title":"Probability with Martingales","author":"Williams","key":"10.1016\/S0304-3975(00)00133-X_BIB24"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750000133X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750000133X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T22:54:13Z","timestamp":1733352853000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750000133X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S030439750000133X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00133-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}