{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T00:10:40Z","timestamp":1791331840319,"version":"4.3.1"},"reference-count":32,"publisher":"Oxford University Press (OUP)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006,3,1]]},"DOI":"10.1093\/comjnl\/bxh168","type":"journal-article","created":{"date-parts":[[2006,1,24]],"date-time":"2006-01-24T01:28:45Z","timestamp":1138066125000},"page":"180-189","source":"Crossref","is-referenced-by-count":10,"title":["Adaptive Routing Using Expert Advice"],"prefix":"10.1093","volume":"49","author":[{"given":"Andr\u00e1s","family":"Gy\u00f6rgy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gy\u00f6rgy","family":"Ottucs\u00e1k","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2006,1,23]]},"reference":[{"key":"key\n\t\t\t\t20171012064249_B1","doi-asserted-by":"crossref","unstructured":"Blackwell, D. (1956) An analog of the minimax theorem for vector payoffs. Pacific J. Math., 6, 1\u20138.","DOI":"10.2140\/pjm.1956.6.1"},{"key":"key\n\t\t\t\t20171012064249_B2","doi-asserted-by":"crossref","unstructured":"Hannan, J. (1957) Approximation to bayes risk in repeated plays. In Dresher, M., Tucker, A. and Wolfe, P. (eds), Contributions to the Theory of Games, pp. 97\u2013139. Princeton University Press.","DOI":"10.1515\/9781400882151-006"},{"key":"key\n\t\t\t\t20171012064249_B3","doi-asserted-by":"crossref","unstructured":"Vovk, V. (1990) Aggregating strategies. In Proc. Third Annual Workshop on Computational Learning Theory, Rochester, NY, August 6\u20138, pp. 372\u2013383. Morgan Kaufmann.","DOI":"10.1016\/B978-1-55860-146-8.50032-1"},{"key":"key\n\t\t\t\t20171012064249_B4","doi-asserted-by":"crossref","unstructured":"Littlestone, N. and Warmuth, M. K. (1994) The weighted majority algorithm. Inform. Comput., 108, 212\u2013261.","DOI":"10.1006\/inco.1994.1009"},{"key":"key\n\t\t\t\t20171012064249_B5","doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi, N., Freund, Y., Helmbold, D. P., Haussler, D., Schapire, R. and Warmuth, M. K. (1997) How to use expert advice. J. ACM, 44, 427\u2013485.","DOI":"10.1145\/258128.258179"},{"key":"key\n\t\t\t\t20171012064249_B6","unstructured":"Gelenbe, E. (2004) Sensible decisions based on QoS. Comput. Manage. Sci., 1(1), 1\u201314."},{"key":"key\n\t\t\t\t20171012064249_B7","doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi, N. and Lugosi, G. (2006) Prediction, Learning, and Games. Cambridge University Press, Cambridge, to appear.","DOI":"10.1017\/CBO9780511546921"},{"key":"key\n\t\t\t\t20171012064249_B8","doi-asserted-by":"crossref","unstructured":"Vovk, V. (1998) A game of prediction with expert advice. J. Comput. Syst. Sci., 56, 153\u2013173.","DOI":"10.1006\/jcss.1997.1556"},{"key":"key\n\t\t\t\t20171012064249_B9","doi-asserted-by":"crossref","unstructured":"Kalai, A. and Vempala, S. (2003) Efficient algorithms for the online decision problem. In Sch\u00f6lkopf, B. and Warmuth, M. (eds), Proc. 16th Annual Conf. Learning Theory and the 7th Kernel Workshop, COLT-Kernel 2003, New York, USA, August 24\u201327, pp. 26\u201340. Springer.","DOI":"10.1007\/978-3-540-45167-9_4"},{"key":"key\n\t\t\t\t20171012064249_B10","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y. and Schapire, R. E. (1995) Gambling in a rigged casino: the adversial multiarmed bandit problem. In Proc. 36th Annual Symp. Foundations of Computer Science, FOCS 1995, Washington, DC, USA, October 23\u201325, pp. 322\u2013331. IEEE Computer Society Press, Los Alamitos, CA."},{"key":"key\n\t\t\t\t20171012064249_B11","doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi, N., Lugosi, G. and Stoltz, G. (2005) Minimizing regret with label efficient prediction. IEEE Trans. Inform. Theory, IT-51, 2152\u20132162.","DOI":"10.1109\/TIT.2005.847729"},{"key":"key\n\t\t\t\t20171012064249_B12","unstructured":"Ottucs\u00e1k, Gy. and Gy\u00f6rgy, A. (2005) A combination of the label efficient and the multi-armed bandit problems in adversarial setting. Preprint."},{"key":"key\n\t\t\t\t20171012064249_B13","doi-asserted-by":"crossref","unstructured":"Schapire, R. E. and Helmbold, D. P. (1997) Predicting nearly as well as the best pruning of a decision tree. Machine Learning, 27, 51\u201368.","DOI":"10.1023\/A:1007396710653"},{"key":"key\n\t\t\t\t20171012064249_B14","unstructured":"Mohri, M. (1998) General Algebraic Frameworks and Algorithms for Shortest Distance Problems. Technical Report 981219-10TM. AT&T Labs Research."},{"key":"key\n\t\t\t\t20171012064249_B15","doi-asserted-by":"crossref","unstructured":"Auer, P. and Warmuth, M. K. (1998) Tracking the best disjunction. Machine Learning, 32, 127\u2013150.","DOI":"10.1023\/A:1007472513967"},{"key":"key\n\t\t\t\t20171012064249_B16","doi-asserted-by":"crossref","unstructured":"Herbster, M. and Warmuth, M. K. (1998) Tracking the best expert. Machine Learning, 32, 151\u2013178.","DOI":"10.1023\/A:1007424614876"},{"key":"key\n\t\t\t\t20171012064249_B17","unstructured":"Bousquet, O. and Warmuth, M. K. (2002) Tracking a small set of experts by mixing past posteriors. J. Machine Learning Res., 3, 363\u2013396."},{"key":"key\n\t\t\t\t20171012064249_B18","doi-asserted-by":"crossref","unstructured":"Takimoto, E. and Warmuth, M. K. (2002) Path kernels and multiplicative updates. In Kivinen, J. and Sloan, R. H. (eds), Proc. 15th Annual Conf. Computational Learning Theory, COLT 2002, Berlin\u2013Heidelberg, July 8\u201310, LNAI2375, 74\u201389. Springer-Verlag.","DOI":"10.1007\/3-540-45435-7_6"},{"key":"key\n\t\t\t\t20171012064249_B19","unstructured":"Takimoto, E. and Warmuth, M. K. (2003) Path kernels and multiplicative updates. J. Machine Learning Res., 4, 773\u2013818."},{"key":"key\n\t\t\t\t20171012064249_B20","doi-asserted-by":"crossref","unstructured":"Gy\u00f6rgy, A., Linder, T. and Lugosi, G. (2004) Efficient algorithms and minimax bounds for zero-delay lossy source coding. IEEE Trans. Signal Proces., 52, 2337\u20132347.","DOI":"10.1109\/TSP.2004.831128"},{"key":"key\n\t\t\t\t20171012064249_B21","doi-asserted-by":"crossref","unstructured":"Gy\u00f6rgy, A., Linder, T. and Lugosi, G. (2005) Tracking the best of many experts. In Proc. 18th Annual Conf. Learning Theory, COLT 2005, Bertinoro, Italy, June 27\u201330, pp. 204\u2013216. Springer.","DOI":"10.1007\/11503415_14"},{"key":"key\n\t\t\t\t20171012064249_B22","doi-asserted-by":"crossref","unstructured":"Gelenbe, E., Gellman, M., Lent, R., Liu, P. and Su, P. (2004) Autonomous smart routing for network QoS. In Proc. First Int. Conf. Autonomic Computing, New York, May 17\u201318, pp. 232\u2013239. IEEE Computer Society.","DOI":"10.1109\/ICAC.2004.1301368"},{"key":"key\n\t\t\t\t20171012064249_B23","doi-asserted-by":"crossref","unstructured":"Gelenbe, E., Lent, R. and Xhu, Z. (2001) Measurement and performance of a cognitive packet network. J. Comput. Netw., 37, 691\u2013701.","DOI":"10.1016\/S1389-1286(01)00253-5"},{"key":"key\n\t\t\t\t20171012064249_B24","doi-asserted-by":"crossref","unstructured":"Auer, P., Cesa-Bianchi, N. and Gentile, C. (2002) Adaptive and self-confident on-line learning algorithms. J. Comput. Syst. Sci., 64, 48\u201375. A preliminary version has appeared in Proc. 13th Ann. Conf. Computational Learning Theory.","DOI":"10.1006\/jcss.2001.1795"},{"key":"key\n\t\t\t\t20171012064249_B25","doi-asserted-by":"crossref","unstructured":"Vovk, V. (1999) Derandomizing stochastic prediction strategies. Machine Learning, 35, 247\u2013282.","DOI":"10.1023\/A:1007595032382"},{"key":"key\n\t\t\t\t20171012064249_B26","doi-asserted-by":"crossref","unstructured":"Robbins, H. (1952) Some aspects of the sequential design of experiments. Bull. Am. Math. Soc., 55, 527\u2013535.","DOI":"10.1090\/S0002-9904-1952-09620-8"},{"key":"key\n\t\t\t\t20171012064249_B27","doi-asserted-by":"crossref","unstructured":"Auer, P., Cesa-Bianchi, N. and Fischer, P. (2002) Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47, 235\u2013256.","DOI":"10.1023\/A:1013689704352"},{"key":"key\n\t\t\t\t20171012064249_B28","unstructured":"Gy\u00f6rgy, A., Linder, T., Lugosi, G. and Ottucs\u00e1k, Gy. The shortest path problem under partial monitoring. In preparation."},{"key":"key\n\t\t\t\t20171012064249_B29","doi-asserted-by":"crossref","unstructured":"Awerbuch, B. and Kleinberg, R. D. (2004) Adaptive routing with end-to-end feedback: distributed learning and geometric approaches. In Proc. 36th Annual ACM Symp. Theory of Computing, STOC 2004, Chicago, IL, June 13\u201315, pp. 45\u201353. ACM Press.","DOI":"10.1145\/1007352.1007367"},{"key":"key\n\t\t\t\t20171012064249_B30","doi-asserted-by":"crossref","unstructured":"McMahan, H. B. and Blum, A. (2004) Online geometric optimization in the bandit setting against an adaptive adversary. In Proc. 17th Annual Conf. Learning Theory, COLT 2004, Banff, Canada, July 1\u20134, pp. 109\u2013123. Springer.","DOI":"10.1007\/978-3-540-27819-1_8"},{"key":"key\n\t\t\t\t20171012064249_B31","unstructured":"Steenstrup, M. (ed.) (1995) Routing in communications networks. Prentice Hall International (UK) Ltd, UK."},{"key":"key\n\t\t\t\t20171012064249_B32","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Holmer, D., Rubens, H. and Kleinberg, R. (2005) Provably Competitive Adaptive Routing. In 31st IEEE INFOCOM 2005, Miami, FL, March 13\u201317.","DOI":"10.1109\/INFCOM.2005.1497929"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/49\/2\/180\/1199970\/bxh168.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,12]],"date-time":"2020-04-12T07:21:25Z","timestamp":1586676085000},"score":1,"resource":{"primary":{"URL":"http:\/\/academic.oup.com\/comjnl\/article\/49\/2\/180\/436730\/Adaptive-Routing-Using-Expert-Advice"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,1,23]]},"references-count":32,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2006,1,23]]},"published-print":{"date-parts":[[2006,3,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxh168","relation":{},"ISSN":["1460-2067","0010-4620"],"issn-type":[{"value":"1460-2067","type":"electronic"},{"value":"0010-4620","type":"print"}],"subject":[],"published-other":{"date-parts":[[2006,3]]},"published":{"date-parts":[[2006,1,23]]}}}