{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:43:55Z","timestamp":1772297035042,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Machine Learning"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1023\/a:1022901500417","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T18:16:51Z","timestamp":1049739411000},"page":"239-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":64,"title":["Potential-Based Algorithms in On-Line Prediction and Game Theory"],"prefix":"10.1007","volume":"51","author":[{"given":"Nicol\u00f2","family":"Cesa-Bianchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"Lugosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"5120299_CR1","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1006\/jcss.2001.1795","volume":"64","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., & Gentile, C. (2002). Adaptive and self-confident on-line learning algorithms. Journal of Computer and System Sciences, 64:1, 48\u201375.","journal-title":"Journal of Computer and System Sciences"},{"key":"5120299_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. (1956). An analog of the minimax theorem for vector payoffs. Pacific Journal of Mathematics, 6, 1\u20138.","journal-title":"Pacific Journal of Mathematics"},{"key":"5120299_CR3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1103\/RevModPhys.34.123","volume":"34","author":"H. Block","year":"1962","unstructured":"Block, H. (1962). The perceptron: A model for brain functioning. Review of Modern Physics, 34, 123\u2013135.","journal-title":"Review of Modern Physics"},{"key":"5120299_CR4","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"L. Bregman","year":"1967","unstructured":"Bregman, L. (1967). The relaxation method of finding the common point of convex sets and its application to the solutions of problems in convex programming. USSR Computational Mathematics and Physics, 7, 200\u2013217.","journal-title":"USSR Computational Mathematics and Physics"},{"issue":"3","key":"5120299_CR5","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1006\/jcss.1999.1635","volume":"59","author":"N. Cesa-Bianchi","year":"1999","unstructured":"Cesa-Bianchi, N. (1999). Analysis of two gradient-based algorithms for on-line regression. Journal of Computer and System Sciences, 59:3, 392\u2013411.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"5120299_CR6","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1145\/258128.258179","volume":"44","author":"N. Cesa-Bianchi","year":"1997","unstructured":"Cesa-Bianchi, N., Freund, Y., Helmbold, D., Haussler, D., Schapire, R., & Warmuth, M. (1997). How to use expert advice. Journal of the ACM, 44:3, 427\u2013485.","journal-title":"Journal of the ACM"},{"key":"5120299_CR7","doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi, N., Conconi, A., & Gentile, C. (2002). A second-order perceptron algorithm. In Proceedings of the 15th Annual Conference on Computational Learning Theory. Lecture Notes in Artificial Intelligence, Springer, 2002.","DOI":"10.1007\/3-540-45435-7_9"},{"issue":"2","key":"5120299_CR8","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1145\/306686.306688","volume":"17","author":"W. Cohen","year":"1999","unstructured":"Cohen,W., & Singer, Y. (1999). Context-sensitive learning methods for text categorization. ACM Transactions on Information Systems, 17:2, 141\u2013173.","journal-title":"ACM Transactions on Information Systems"},{"key":"5120299_CR9","unstructured":"Cover, T., & Thomas, J. (1991). Elements of Information Theory. John Wiley and Sons."},{"key":"5120299_CR10","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1006\/game.1997.0595","volume":"21","author":"D. Foster","year":"1997","unstructured":"Foster, D., & Vohra, R. (1997). Calibrated learning and correlated equilibrium. Games and Economic Behaviour, 21, 40\u201355.","journal-title":"Games and Economic Behaviour"},{"issue":"1\/2","key":"5120299_CR11","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1006\/game.1999.0740","volume":"29","author":"D. Foster","year":"1999","unstructured":"Foster, D., & Vohra, R. (1999). Regret in the on-line decision problem. Games and Economic Behaviour, 29:1\/2, 7\u201335.","journal-title":"Games and Economic Behaviour"},{"issue":"1","key":"5120299_CR12","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Freund, Y., & Schapire, R. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55:1, 119\u2013139.","journal-title":"Journal of Computer and System Sciences"},{"key":"5120299_CR13","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1006\/game.1999.0738","volume":"29","author":"Y. Freund","year":"1999","unstructured":"Freund, Y., & Schapire, R. (1999a). Adaptive game playing using multiplicative weights. Games and Economic Behavior, 29, 79\u2013103.","journal-title":"Games and Economic Behavior"},{"issue":"3","key":"5120299_CR14","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1023\/A:1007662407062","volume":"37","author":"Y. Freund","year":"1999","unstructured":"Freund,Y., & Schapire, R. (1999b). Large margin classification using the perceptron algorithm. Machine Learning, 37:3, 277\u2013296.","journal-title":"Machine Learning"},{"key":"5120299_CR15","doi-asserted-by":"crossref","unstructured":"Freund, Y., Schapire, R., Singer, Y., & Warmuth, M. (1997). Using and combining predictors that specialize. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (pp. 334\u2013343). ACM Press.","DOI":"10.1145\/258533.258616"},{"key":"5120299_CR16","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1016\/0165-1889(94)00819-4","volume":"19","author":"D. Fudenberg","year":"1995","unstructured":"Fudenberg, D., & Levine, D. (1995). Universal consistency and cautious fictitious play. Journal of Economic, Dynamics, and Control, 19, 1065\u20131090.","journal-title":"Journal of Economic, Dynamics, and Control"},{"key":"5120299_CR17","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1006\/game.1999.0740","volume":"29","author":"D. Fudenberg","year":"1999","unstructured":"Fudenberg, D., & Levine, D. (1999). Conditional universal consistency. Games and Economic Behaviour, 29, 7\u201335.","journal-title":"Games and Economic Behaviour"},{"key":"5120299_CR18","doi-asserted-by":"crossref","unstructured":"Gentile, C. (2001). The robustness of the p-norm algorithms.An extended abstract (co-authored with N. Littlestone) appeared in the Proceedings of the 12th Annual Conference on Computational Learning Theory (pp. 1\u201311). ACM Press, 1999.","DOI":"10.1145\/307400.307405"},{"key":"5120299_CR19","unstructured":"Gentile, C., & Warmuth, M. (1999). Linear hinge loss and average margin. In Advances in Neural Information Processing Systems 10. MIT Press."},{"key":"5120299_CR20","doi-asserted-by":"crossref","unstructured":"Grove, A., Littlestone, N., & Schuurmans, D. (1997). General convergence results for linear discriminant updates. In Proceedings of the 10th Annual Conference on Computational Learning Theory (pp. 171\u2013183). ACM Press.","DOI":"10.1145\/267460.267493"},{"issue":"3","key":"5120299_CR21","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1023\/A:1010844028087","volume":"43","author":"A. Grove","year":"2001","unstructured":"Grove, A., Littlestone, N., & Schuurmans, D. (2001). General convergence results for linear discriminant updates. Machine Learning, 43:3, 173\u2013210.","journal-title":"Machine Learning"},{"key":"5120299_CR22","first-page":"97","volume":"3","author":"J. Hannan","year":"1957","unstructured":"Hannan, J. (1957). Approximation to bayes risk in repeated play. Contributions to the Theory of Games, 3, 97\u2013139.","journal-title":"Contributions to the Theory of Games"},{"key":"5120299_CR23","doi-asserted-by":"crossref","first-page":"1127","DOI":"10.1111\/1468-0262.00153","volume":"68","author":"S. Hart","year":"2000","unstructured":"Hart, S., & Mas-Colell, A. (2000). A simple adaptive procedure leading to correlated equilibrium. Econometrica, 68, 1127\u20131150.","journal-title":"Econometrica"},{"issue":"1","key":"5120299_CR24","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1006\/jeth.2000.2746","volume":"98","author":"S. Hart","year":"2001","unstructured":"Hart, S., & Mas-Colell, A. (2001). A general class of adaptive strategies. Journal of Economic Theory, 98:1, 26\u201354.","journal-title":"Journal of Economic Theory"},{"key":"5120299_CR25","doi-asserted-by":"crossref","first-page":"1906","DOI":"10.1109\/18.705569","volume":"44","author":"D. Haussler","year":"1998","unstructured":"Haussler, D., Kivinen, J., & Warmuth, M. (1998). Sequential prediction of individual sequences under general loss functions. IEEE Transactions on Information Theory, 44, 1906\u20131925.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5120299_CR26","doi-asserted-by":"crossref","unstructured":"Kivinen, J., & Warmuth, M. (1999). Averaging expert predictions. In Proceedings of the Fourth European Conference on Computational Learning Theory (pp. 153\u2013167). Lecture Notes in Artificial Intelligence, vol. 1572. Springer.","DOI":"10.1007\/3-540-49097-3_13"},{"issue":"3","key":"5120299_CR27","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1023\/A:1017938623079","volume":"45","author":"J. Kivinen","year":"2001","unstructured":"Kivinen, J., & Warmuth, M. (2001). Relative loss bounds for multidimensional regression problems. Machine Learning, 45:3, 301\u2013329.","journal-title":"Machine Learning"},{"key":"5120299_CR28","unstructured":"Lehrer, E. (2001). A wide range no-regret theorem. Games and Economic Behavior, in press."},{"key":"5120299_CR29","unstructured":"Littlestone, N. (1989). Mistake bounds and logarithmic linear-threshold learning algorithms. Ph.D. Thesis, University of California at Santa Cruz."},{"key":"5120299_CR30","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N. Littlestone","year":"1994","unstructured":"Littlestone, N., & Warmuth, M. (1994). The weighted majority algorithm. Information and Computation, 108, 212\u2013261.","journal-title":"Information and Computation"},{"key":"5120299_CR31","first-page":"615","volume":"XII","author":"A. Novikoff","year":"1962","unstructured":"Novikoff, A. (1962). On convergence proofs of perceptrons. In Proceedings of the Symposium on the Mathematical Theory of Automata, vol. XII. pp. 615\u2013622.","journal-title":"Proceedings of the Symposium on the Mathematical Theory of Automata"},{"key":"5120299_CR32","unstructured":"Rosenblatt, F. (1962). Principles of Neurodynamics. Spartan Books."},{"issue":"5","key":"5120299_CR33","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1023\/A:1010800213066","volume":"43","author":"R. Schapire","year":"2001","unstructured":"Schapire, R. (2001). Drifting games. Machine Learning, 43:5, 265\u2013291.","journal-title":"Machine Learning"},{"key":"5120299_CR34","doi-asserted-by":"crossref","unstructured":"Seneta, E. (1981). Non-Negative Matrices and Markov Chains. Springer.","DOI":"10.1007\/0-387-32792-4"},{"key":"5120299_CR35","doi-asserted-by":"crossref","unstructured":"Vovk, V. (1990). Aggregating strategies. In Proceedings of the 3rd Annual Workshop on Computational Learning Theory. pp. 372\u2013383.","DOI":"10.1016\/B978-1-55860-146-8.50032-1"},{"key":"5120299_CR36","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1006\/jcss.1997.1556","volume":"56","author":"V. Vovk","year":"1998","unstructured":"Vovk, V. (1998). A game of prediction with expert advice. Journal of Computer and System Sciences, 56:2, 153\u2013173.","journal-title":"Journal of Computer and System Sciences"},{"key":"5120299_CR37","first-page":"213","volume":"69","author":"V. Vovk","year":"2001","unstructured":"Vovk, V. (2001). Competitive on-line statistics. International Statistical Review, 69, 213\u2013248.","journal-title":"International Statistical Review"},{"key":"5120299_CR38","unstructured":"Warmuth, M., & Jagota, A. (1997). Continuous and discrete-time nonlinear gradient descent: Relative loss bounds and convergence. In Electronic Proceedings of the 5th International Symposium on Artificial Intelligence and Mathematics."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022901500417.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1022901500417\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022901500417.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:34:20Z","timestamp":1752147260000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1022901500417"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["5120299"],"URL":"https:\/\/doi.org\/10.1023\/a:1022901500417","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,6]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}