{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T02:10:17Z","timestamp":1736561417473,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540352945"},{"type":"electronic","value":"9783540352969"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11776420_35","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T14:49:15Z","timestamp":1159454955000},"page":"468-482","source":"Crossref","is-referenced-by-count":3,"title":["The Shortest Path Problem Under Partial Monitoring"],"prefix":"10.1007","author":[{"given":"Andr\u00e1s","family":"Gy\u00f6rgy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Linder","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":[{"issue":"1","key":"35_CR1","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1137\/S0097539701398375","volume":"32","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.: The non-stochastic multi-armed bandit problem. SIAM Journal on Computing\u00a032(1), 48\u201377 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Holmer, D., Rubens, H., Kleinberg, R.: Provably competitive adaptive routing. In: Proceedings of IEEE INFOCOM 2005, vol.\u00a01, pp. 631\u2013641 (March 2005)","DOI":"10.1109\/INFCOM.2005.1497929"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/1007352.1007367","volume-title":"Proceedings of the 36th Annual ACM Symposium on the Theory of Computing, STOC 2004","author":"B. Awerbuch","year":"2004","unstructured":"Awerbuch, B., Kleinberg, R.D.: Adaptive routing with end-to-end feedback: distributed learning and geometric approaches. In: Proceedings of the 36th Annual ACM Symposium on the Theory of Computing, STOC 2004, Chicago, IL, USA, pp. 45\u201353. ACM Press, New York (2004)"},{"key":"35_CR4","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"},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1162\/153244303321897654","volume":"3","author":"O. Bousquet","year":"2002","unstructured":"Bousquet, O., Warmuth, M.K.: Tracking a small set of experts by mixing past posteriors. Journal of Machine Learning Research\u00a03, 363\u2013396 (2002)","journal-title":"Journal of Machine Learning Research"},{"issue":"3","key":"35_CR6","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":"35_CR7","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":"35_CR8","doi-asserted-by":"publisher","first-page":"2152","DOI":"10.1109\/TIT.2005.847729","volume":"IT-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\u00a0IT-51, 2152\u20132162 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"35_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0711-5","volume-title":"A Probabilistic Theory of Pattern Recognition","author":"L. Devroye","year":"1996","unstructured":"Devroye, L., Gy\u00f6rfi, L., Lugosi, G.: A Probabilistic Theory of Pattern Recognition. Springer, New York (1996)"},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1109\/ICAC.2004.1301368","volume-title":"Proceedings of First International Conference on Autonomic Computing","author":"E. Gelenbe","year":"2004","unstructured":"Gelenbe, E., Gellman, M., Lent, R., Liu, P., Su, P.: Autonomous smart routing for network QoS. In: Proceedings of First International Conference on Autonomic Computing, pp. 232\u2013239. IEEE Computer Society, Los Alamitos (2004)"},{"key":"35_CR11","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1016\/S1389-1286(01)00253-5","volume":"37","author":"E. Gelenbe","year":"2001","unstructured":"Gelenbe, E., Lent, R., Xhu, Z.: Measurement and performance of a cognitive packet network. Journal of Computer Networks\u00a037, 691\u2013701 (2001)","journal-title":"Journal of Computer Networks"},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"2337","DOI":"10.1109\/TSP.2004.831128","volume":"52","author":"A. Gy\u00f6rgy","year":"2004","unstructured":"Gy\u00f6rgy, A., Linder, T., Lugosi, G.: Efficient algorithms and minimax bounds for zero-delay lossy source coding. IEEE Transactions on Signal Processing\u00a052, 2337\u20132347 (2004)","journal-title":"IEEE Transactions on Signal Processing"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Gy\u00f6rgy, A., Linder, T., Lugosi, G.: A \u201cfollow the perturbed leader\u201d-type algorithm for zero-delay quantization of individual sequences. In: Proc. Data Compression Conference, Snowbird, UT, USA, pp. 342\u2013351 (March 2004)","DOI":"10.1109\/DCC.2004.1281479"},{"key":"35_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/11503415_14","volume-title":"Learning Theory","author":"A. Gy\u00f6rgy","year":"2005","unstructured":"Gy\u00f6rgy, A., Linder, T., Lugosi, G.: Tracking the best of many experts. In: Auer, P., Meir, R. (eds.) COLT 2005. LNCS, vol.\u00a03559, pp. 204\u2013216. Springer, Heidelberg (2005)"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Gy\u00f6rgy, A., Linder, T., Lugosi, G.: Tracking the best quantizer. In: Proceedings of the IEEE International Symposium on Information Theory, Adelaide, Australia,pp. 1163\u20131167 ( June-July 2005)","DOI":"10.1109\/ISIT.2005.1523524"},{"issue":"2","key":"35_CR16","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":"35_CR17","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)"},{"key":"35_CR18","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1023\/A:1007396710653","volume":"27","author":"D.P. Helmbold","year":"1997","unstructured":"Helmbold, D.P., Schapire, R.E.: Predicting nearly as well as the best pruning of a decision tree. Machine Learning\u00a027, 51\u201368 (1997)","journal-title":"Machine Learning"},{"issue":"2","key":"35_CR19","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1023\/A:1007424614876","volume":"32","author":"M. Herbster","year":"1998","unstructured":"Herbster, M., Warmuth, M.K.: Tracking the best expert. Machine Learning\u00a032(2), 151\u2013178 (1998)","journal-title":"Machine Learning"},{"key":"35_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-540-45167-9_4","volume-title":"Learning Theory and Kernel Machines","author":"A.T. Kalai","year":"2003","unstructured":"Kalai, A.T., Vempala, S.S.: Efficient algorithms for online decision problems. In: Sch\u00f6lkopf, B., Warmuth, M.K. (eds.) COLT\/Kernel 2003. LNCS, vol.\u00a02777, pp. 26\u201340. Springer, Heidelberg (2003)"},{"key":"35_CR21","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":"35_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-540-27819-1_8","volume-title":"Learning Theory","author":"H.B. McMahan","year":"2004","unstructured":"McMahan, H.B., Blum, A.: Online geometric optimization in the bandit setting against an adaptive adversary. In: Shawe-Taylor, J., Singer, Y. (eds.) COLT 2004. LNCS, vol.\u00a03120, pp. 109\u2013123. Springer, Heidelberg (2004)"},{"key":"35_CR23","unstructured":"Mohri, M.: General algebraic frameworks and algorithms for shortest distance problems. Technical Report 981219-10TM, AT&T Labs Research (1998)"},{"key":"35_CR24","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1162\/1532443041424328","volume":"4","author":"E. Takimoto","year":"2003","unstructured":"Takimoto, E., Warmuth, M.K.: Path kernels and multiplicative updates. Journal of Machine Learning Research\u00a04, 773\u2013818 (2003)","journal-title":"Journal of Machine Learning Research"},{"key":"35_CR25","first-page":"372","volume-title":"Proceedings of the Third Annual Workshop on Computational Learning Theory","author":"V. Vovk","year":"1990","unstructured":"Vovk, V.: Aggregating strategies. In: Proceedings of the Third Annual Workshop on Computational Learning Theory, Rochester, NY, pp. 372\u2013383. Morgan Kaufmann, San Francisco (1990)"},{"issue":"3","key":"35_CR26","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1023\/A:1007595032382","volume":"35","author":"V. Vovk","year":"1999","unstructured":"Vovk, V.: Derandomizing stochastic prediction strategies. Machine Learning\u00a035(3), 247\u2013282 (1999)","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11776420_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T01:40:11Z","timestamp":1736559611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11776420_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540352945","9783540352969"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11776420_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}