{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:32:20Z","timestamp":1742383940241,"version":"3.30.2"},"reference-count":41,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"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":[[2003,5]]},"DOI":"10.1016\/s0890-5401(02)00033-0","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T21:13:10Z","timestamp":1051132390000},"page":"73-94","source":"Crossref","is-referenced-by-count":6,"title":["Predicting a binary sequence almost as well as the optimal biased coin"],"prefix":"10.1016","volume":"182","author":[{"given":"Yoav","family":"Freund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0890-5401(02)00033-0_BIB1","unstructured":"Abramowitz, Stegun, Handbook of Mathematical Functions, National Bureau of Standards, 1970"},{"key":"10.1016\/S0890-5401(02)00033-0_BIB2","unstructured":"A. Barron, J. Rissanen, B. Yu, The minimum description length principle in coding and modeling, IEEE Trans. Inform. Theory 44 (6) (1998) 2743\u20132760; Inform. Theory: 1948\u20131998"},{"key":"10.1016\/S0890-5401(02)00033-0_BIB3","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1111\/j.2517-6161.1979.tb01066.x","article-title":"Reference posterior distributions for Bayesian inference","volume":"41","author":"Bernardo","year":"1979","journal-title":"J. Roy. Stat. Soc. B."},{"issue":"1","key":"10.1016\/S0890-5401(02)00033-0_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2140\/pjm.1956.6.1","article-title":"An analog of the minimax theorem for vector payoffs","volume":"6","author":"Blackwell","year":"1956","journal-title":"Pacific J. Math."},{"year":"1954","series-title":"Theory of Games and Statistical Decisions","author":"Blackwell","key":"10.1016\/S0890-5401(02)00033-0_BIB5"},{"key":"10.1016\/S0890-5401(02)00033-0_BIB6","doi-asserted-by":"crossref","unstructured":"N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, D. Haussler, R.E. Schapire, M. K. Warmuth. How to use expert advice, in: Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, 1993, pp 382\u2013391","DOI":"10.1145\/167088.167198"},{"issue":"6","key":"10.1016\/S0890-5401(02)00033-0_BIB7","doi-asserted-by":"crossref","first-page":"1865","DOI":"10.1214\/aos\/1017939242","article-title":"On prediction of individual sequences","volume":"27","author":"Cesa-Bianchi","year":"1999","journal-title":"Ann. Stat."},{"key":"10.1016\/S0890-5401(02)00033-0_BIB8","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0378-3758(94)90153-8","article-title":"Jeffrey\u2019s prior is asymptotically least favorable under entropic risk","volume":"41","author":"Clarke","year":"1994","journal-title":"J. Stat. Planning Inference"},{"issue":"March","key":"10.1016\/S0890-5401(02)00033-0_BIB9","article-title":"Universal portfolios with side information","author":"Cover","year":"1996","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0890-5401(02)00033-0_BIB10","unstructured":"T.M. Cover, Behavior of sequential predictors of binary sequences, in: Transactions of the Fourth Prague Conference on Information Theory, Statistical Decision Functions, Random Processes (Prague, 1965), Academia, Prague, 1967, pp. 263\u2013272"},{"issue":"1","key":"10.1016\/S0890-5401(02)00033-0_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1467-9965.1991.tb00002.x","article-title":"Universal portfolios","volume":"1","author":"Cover","year":"1991","journal-title":"Math. Finance"},{"key":"10.1016\/S0890-5401(02)00033-0_BIB12","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1109\/TIT.1973.1055092","article-title":"Universal noiseless coding","volume":"19","author":"Davisson","year":"1973","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0890-5401(02)00033-0_BIB13","unstructured":"N.G. de Buijn, Asymptotic Methods in Analysis. Dover, New York, 1958, 1981. A good introduction to Laplace Method and the Saddle Point method for approximating integrals"},{"key":"10.1016\/S0890-5401(02)00033-0_BIB14","doi-asserted-by":"crossref","first-page":"1258","DOI":"10.1109\/18.144706","article-title":"Universal prediction of individual sequences","volume":"38","author":"Feder","year":"1992","journal-title":"IEEE Trans. Inform. Theory"},{"year":"1967","series-title":"Mathematical Statistics: A Decision Theoretic Approach","author":"Ferguson","key":"10.1016\/S0890-5401(02)00033-0_BIB15"},{"issue":"2","key":"10.1016\/S0890-5401(02)00033-0_BIB16","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1214\/aos\/1176348140","article-title":"Prediction in the worst case","volume":"19","author":"Foster","year":"1991","journal-title":"Ann. Stat."},{"key":"10.1016\/S0890-5401(02)00033-0_BIB17","doi-asserted-by":"crossref","unstructured":"D.P. Foster, R. Vohra, Regret in the on-line decision problem. Games Econ. Behavior 29 (1\u20132) (1999) 7\u201335. Learning in games: a symposium in honor of David Blackwell","DOI":"10.1006\/game.1999.0740"},{"key":"10.1016\/S0890-5401(02)00033-0_BIB18","doi-asserted-by":"crossref","unstructured":"Y. Freund, Predicting a binary sequence almost as well as the optimal biased coin, in: Proceedings of the Ninth Annual Conference on Computational Learning Theory, 1996","DOI":"10.1145\/238061.238072"},{"key":"10.1016\/S0890-5401(02)00033-0_BIB19","doi-asserted-by":"crossref","unstructured":"J. Hannan, Approximation to Bayes risk in repeated play, in: M. Dresher, A.W. Tucker, P. Wolfe (Eds.), Contributions to the Theory of Games, vol. III, Princeton University Press, Princeton, NJ, 1957, pp. 97\u2013139","DOI":"10.1515\/9781400882151-006"},{"issue":"5","key":"10.1016\/S0890-5401(02)00033-0_BIB20","doi-asserted-by":"crossref","first-page":"1127","DOI":"10.1111\/1468-0262.00153","article-title":"A simple adaptive procedure leading to correlated equilibrium","volume":"68","author":"Hart","year":"2000","journal-title":"Econometrica"},{"issue":"4","key":"10.1016\/S0890-5401(02)00033-0_BIB21","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1109\/18.605594","article-title":"A general minimax result for relative entropy","volume":"43","author":"Haussler","year":"1997","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0890-5401(02)00033-0_BIB22","first-page":"69","article-title":"Tight worst-case loss bounds for predicting with expert advice","author":"Haussler","year":"1995"},{"article-title":"Worst case prediction over sequences under log loss","year":"1998","author":"Haussler","key":"10.1016\/S0890-5401(02)00033-0_BIB23"},{"year":"1993","series-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"Li","key":"10.1016\/S0890-5401(02)00033-0_BIB24"},{"key":"10.1016\/S0890-5401(02)00033-0_BIB25","doi-asserted-by":"crossref","unstructured":"N. Littlestone, Learning when irrelevant attributes abound, in: 28th Annual Symposium on Foundations of Computer Science, October 1987, pp. 68\u201377","DOI":"10.1109\/SFCS.1987.37"},{"key":"10.1016\/S0890-5401(02)00033-0_BIB26","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. Comput."},{"year":"1973","series-title":"Asymptotic Analysis","author":"Murray","key":"10.1016\/S0890-5401(02)00033-0_BIB27"},{"key":"10.1016\/S0890-5401(02)00033-0_BIB28","series-title":"Stochastic Complexity in Statistical Inquiry","volume":"vol. 15","author":"Rissanen","year":"1989"},{"issue":"1","key":"10.1016\/S0890-5401(02)00033-0_BIB29","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/TIT.1981.1056282","article-title":"Universal modeling and coding","volume":"IT-27","author":"Rissanen","year":"1981","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"10.1016\/S0890-5401(02)00033-0_BIB30","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/18.481776","article-title":"Fisher information and stochastic complexity","volume":"42","author":"Rissanen","year":"1996","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"July\u2013September","key":"10.1016\/S0890-5401(02)00033-0_BIB31","first-page":"175","article-title":"Universal sequential coding of single messages","volume":"23","author":"Shtar\u2018kov","year":"1987","journal-title":"Problems Inform. Transmission (Trans. Russian)"},{"key":"10.1016\/S0890-5401(02)00033-0_BIB32","series-title":"Topics in Information Theory","first-page":"559","article-title":"Coding of descrete sources with unknown statistics","author":"Shtarkov","year":"1975"},{"issue":"12","key":"10.1016\/S0890-5401(02)00033-0_BIB33","article-title":"Some notes on universal noiseless coding","volume":"E78-A","author":"Suzuki","year":"1995","journal-title":"IEICE Trans. Fundam."},{"issue":"2","key":"10.1016\/S0890-5401(02)00033-0_BIB34","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. Comp. Syst. Sci."},{"key":"10.1016\/S0890-5401(02)00033-0_BIB35","doi-asserted-by":"crossref","unstructured":"V.G. Vovk, Aggregating strategies, in: Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990, pp. 371\u2013383","DOI":"10.1016\/B978-1-55860-146-8.50032-1"},{"year":"1952","series-title":"Theory of Bessel functions","author":"Watson","key":"10.1016\/S0890-5401(02)00033-0_BIB36"},{"issue":"3","key":"10.1016\/S0890-5401(02)00033-0_BIB37","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1109\/18.382012","article-title":"The context tree weighting method: basic properties","volume":"41","author":"Willems","year":"1995","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0890-5401(02)00033-0_BIB38","first-page":"446","article-title":"Minimax redundancy for the class of memoryless sources","volume":"43","author":"Xie","year":"1997","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"10.1016\/S0890-5401(02)00033-0_BIB39","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1109\/18.825803","article-title":"Asymptotic minimax regret for data compression, gambling, and prediction","volume":"46","author":"Xie","year":"2000","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"10.1016\/S0890-5401(02)00033-0_BIB40","doi-asserted-by":"crossref","first-page":"1424","DOI":"10.1109\/18.681319","article-title":"A decision-theoretic extension of stochastic complexity and its applications to learning","volume":"44","author":"Yamanishi","year":"1998","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0890-5401(02)00033-0_BIB41","unstructured":"Z. Zhang, Discrete noninformative prioirs, Ph.D. Thesis, Yale University, 1994"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540102000330?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540102000330?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T06:11:23Z","timestamp":1733983883000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540102000330"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0890540102000330"],"URL":"https:\/\/doi.org\/10.1016\/s0890-5401(02)00033-0","relation":{},"ISSN":["0890-5401"],"issn-type":[{"type":"print","value":"0890-5401"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}