{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:26:04Z","timestamp":1774416364361,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540466499","type":"print"},{"value":"9783540466505","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11894841_20","type":"book-chapter","created":{"date-parts":[[2006,10,4]],"date-time":"2006-10-04T11:29:53Z","timestamp":1159961393000},"page":"229-243","source":"Crossref","is-referenced-by-count":13,"title":["Hannan Consistency in On-Line Learning in Case of Unbounded Losses Under Partial Monitoring"],"prefix":"10.1007","author":[{"given":"Chamy","family":"Allenberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Auer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L\u00e1szl\u00f3","family":"Gy\u00f6rfi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gy\u00f6rgy","family":"Ottucs\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","first-page":"322","volume-title":"Proceedings of the 36th Annual Symposium on Foundations of Computer Science, FOCS 1995","author":"P. Auer","year":"1995","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: Gambling in a rigged casino: the adversial multi-armed bandit problem. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, FOCS 1995, Washington, DC, USA, October 1995, pp. 322\u2013331. IEEE Computer Society Press, Los Alamitos, CA (1995)"},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2140\/pjm.1956.6.1","volume":"6","author":"D. Blackwell","year":"1956","unstructured":"Blackwell, D.: An analog of the minimax theorem for vector payoffs. Pacific Journal of Mathematics\u00a06, 1\u20138 (1956)","journal-title":"Pacific Journal of Mathematics"},{"issue":"3","key":"20_CR3","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/258128.258179","volume":"44","author":"N. Cesa-Bianchi","year":"1997","unstructured":"Cesa-Bianchi, N., Freund, Y., Helmbold, D.P., Haussler, D., Schapire, R., Warmuth, M.K.: How to use expert advice. Journal of the ACM\u00a044(3), 427\u2013485 (1997)","journal-title":"Journal of the ACM"},{"key":"20_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921","volume-title":"Prediction, Learning, and Games","author":"N. Cesa-Bianchi","year":"2006","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Prediction, Learning, and Games. Cambridge University Press, Cambridge (2006)"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"2152","DOI":"10.1109\/TIT.2005.847729","volume":"51","author":"N. Cesa-Bianchi","year":"2005","unstructured":"Cesa-Bianchi, N., Lugosi, G., Stoltz, G.: Minimizing regret with label efficient prediction. IEEE Trans. Inform. Theory\u00a051, 2152\u20132162 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/11503415_15","volume-title":"Learning Theory","author":"N. Cesa-Bianchi","year":"2005","unstructured":"Cesa-Bianchi, N., Mansour, Y., Stoltz, G.: Improved second-order bounds for prediction with expert advice. In: Auer, P., Meir, R. (eds.) COLT 2005. LNCS, vol.\u00a03559, pp. 217\u2013232. Springer, Heidelberg (2005)"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi, N., Mansour, Y., Stoltz, G.: Improved second-order bounds for prediction with expert advice (submitted, 2006)","DOI":"10.1007\/11503415_15"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1214\/aoms\/1177700166","volume":"36","author":"Y.S. Chow","year":"1965","unstructured":"Chow, Y.S.: Local convergence of martingales and the law of large numbers. Annals of Mathematical Statistics\u00a036, 552\u2013558 (1965)","journal-title":"Annals of Mathematical Statistics"},{"key":"20_CR9","first-page":"225","volume-title":"Modelling Uncertainty: An Examination of its Theory, Methods and Applications","author":"L. Gy\u00f6rfi","year":"2001","unstructured":"Gy\u00f6rfi, L., Lugosi, G.: Strategies for sequential prediction of stationary time series. In: Dror, M., L\u2019Ecuyer, P., Szidarovszky, F. (eds.) Modelling Uncertainty: An Examination of its Theory, Methods and Applications, pp. 225\u2013248. Kluwer Academic Publishers, Dordrecht (2001)"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Gy\u00f6rfi, L., Ottucs\u00e1k, G.: Sequential prediction of unbounded stationary time series (submitted, 2006)","DOI":"10.1109\/TIT.2007.894660"},{"issue":"2","key":"20_CR11","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1093\/comjnl\/bxh168","volume":"49","author":"A. Gy\u00f6rgy","year":"2006","unstructured":"Gy\u00f6rgy, A., Ottucs\u00e1k, G.: Adaptive routing using expert advice. The Computer Journal\u00a049(2), 180\u2013189 (2006)","journal-title":"The Computer Journal"},{"key":"20_CR12","first-page":"97","volume-title":"Contributions to the Theory of Games","author":"J. Hannan","year":"1957","unstructured":"Hannan, J.: Approximation to bayes risk in repeated plays. In: Dresher, M., Tucker, A., Wolfe, P. (eds.) Contributions to the Theory of Games, vol.\u00a03, pp. 97\u2013139. Princeton University Press, Princeton (1957)"},{"issue":"5","key":"20_CR13","first-page":"181","volume":"68","author":"S. Hart","year":"2002","unstructured":"Hart, S., Mas-Colell, A.: A simple adaptive procedure leading to correlated equilibrium. Econometria\u00a068(5), 181\u2013200 (2002)","journal-title":"Econometria"},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N. Littlestone","year":"1994","unstructured":"Littlestone, N., Warmuth, M.K.: The weighted majority algorithm. Information and Computation\u00a0108, 212\u2013261 (1994)","journal-title":"Information and Computation"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/11564089_28","volume-title":"Algorithmic Learning Theory","author":"J. Poland","year":"2005","unstructured":"Poland, J., Hutter, M.: Defensive universal learning with experts. In: Jain, S., Simon, H.U., Tomita, E. (eds.) ALT 2005. LNCS, vol.\u00a03734, pp. 356\u2013370. Springer, Heidelberg (2005)"},{"key":"20_CR16","first-page":"372","volume-title":"Proceedings of the 3rd Annual Workshop on Computational Learning Theory","author":"V. Vovk","year":"1990","unstructured":"Vovk, V.: Aggregating strategies. In: Proceedings of the 3rd Annual Workshop on Computational Learning Theory, Rochester, NY, pp. 372\u2013383. Morgan Kaufmann, San Francisco (1990)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11894841_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:55:34Z","timestamp":1605642934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11894841_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540466499","9783540466505"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11894841_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}