{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:18:10Z","timestamp":1726409890682},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642112652"},{"type":"electronic","value":"9783642112669"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11266-9_6","type":"book-chapter","created":{"date-parts":[[2009,12,7]],"date-time":"2009-12-07T09:04:58Z","timestamp":1260176698000},"page":"71-76","source":"Crossref","is-referenced-by-count":0,"title":["Regret Minimization and Job Scheduling"],"prefix":"10.1007","author":[{"given":"Yishay","family":"Mansour","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2-3","key":"6_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-Time Analysis of the Multi-Armed Bandit Problem. Machine Learning\u00a047(2-3), 235\u2013256 (2002)","journal-title":"Machine Learning"},{"issue":"1","key":"6_CR2","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1137\/S0097539701398375","volume":"32","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: The Nonstochastic Multiarmed Bandit Problem. SIAM Journal on Computing\u00a032(1), 48\u201377 (2002); (A\u00a0preliminary version appeared in FOCS 1995 as Gambling in a Rigged Casino: The Adversarial Multi-Armed Bandit Problem)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"6_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.jcss.2007.04.016","volume":"74","author":"B. Awerbuch","year":"2008","unstructured":"Awerbuch, B., Kleinberg, R.: Online Linear Optimization and Adaptive Routing. J. Comput. Syst. Sci.\u00a074(1), 97\u2013114 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Mansour, Y.: Adapting to a Reliable Network Path. In: PODC, pp. 360\u2013367 (2003)","DOI":"10.1145\/872035.872090"},{"key":"6_CR5","first-page":"1307","volume":"8","author":"A. Blum","year":"2007","unstructured":"Blum, A., Mansour, Y.: From External to Internal Regret. Journal of Machine Learning Research\u00a08, 1307\u20131324 (2007)","journal-title":"Journal of Machine Learning Research"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Blum, A., Burch, C.: On-Line Learning and the Metrical Task System Problem. In: COLT, pp.\u00a045\u201353 (1997)","DOI":"10.1145\/267460.267475"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Blum, A., Burch, C., Kalai, A.: Finely-Competitive Paging. In: FOCS, pp. 450\u2013458 (1999)","DOI":"10.1109\/SFFCS.1999.814617"},{"issue":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00453-003-1015-8","volume":"36","author":"A. Blum","year":"2003","unstructured":"Blum, A., Chawla, S., Kalai, A.: Static Optimality and Dynamic Search-Optimality in Lists and Trees. Algorithmica\u00a036(3), 249\u2013260 (2003)","journal-title":"Algorithmica"},{"key":"6_CR9","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"6_CR10","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"6_CR11","doi-asserted-by":"crossref","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":"6_CR12","doi-asserted-by":"crossref","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, New York (2006)"},{"issue":"3","key":"6_CR13","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.P., Haussler, D., Schapire, R.E., Warmuth, M.K.: How to Use Expert Advice. Journal of the ACM\u00a044(3), 427\u2013485 (1997); (A preliminary version appeared in STOC\u00a01993)","journal-title":"Journal of the ACM"},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1023\/A:1022901500417","volume":"51","author":"N. Cesa-Bianchi","year":"2003","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Potential-Based Algorithms in On-Line Prediction and Game Theory. Machine Learning\u00a051(3), 239\u2013261 (2003)","journal-title":"Machine Learning"},{"key":"6_CR15","unstructured":"Even-Dar, E., Kleinberg, R., Mannor, S., Mansour, Y.: Online Learning for Global Cost Functions. In: COLT (2009)"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1006\/game.1997.0595","volume":"21","author":"D. Foster","year":"1997","unstructured":"Foster, D., Vohra, R.: Regret in the On-Line Decision Problem. Games and Economic Behavior\u00a021, 40\u201355 (1997)","journal-title":"Games and Economic Behavior"},{"issue":"4","key":"6_CR17","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1287\/opre.41.4.704","volume":"41","author":"D.P. Foster","year":"1993","unstructured":"Foster, D.P., Vohra, R.V.: A Randomization Rule for Selecting Forecasts. Operations Research\u00a041(4), 704\u2013709 (1993)","journal-title":"Operations Research"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Freund, Y., Schapire, R.E., Singer, Y., Warmuth, M.K.: Using and Combining Predictors that Specialize. In: STOC, pp. 334\u2013343 (1997)","DOI":"10.1145\/258533.258616"},{"key":"6_CR19","first-page":"23","volume-title":"Euro-COLT","author":"Y. Freund","year":"1995","unstructured":"Freund, Y., Schapire, R.E.: A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting. In: Euro-COLT, pp. 23\u201337. Springer, Heidelberg (1995)"},{"key":"6_CR20","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":"6_CR21","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1111\/1468-0262.00153","volume":"68","author":"S. Hart","year":"2000","unstructured":"Hart, S., Mas-Colell, A.: A Simple Adaptive Procedure Leading to Correlated Equilibrium. Econometrica\u00a068, 1127\u20131150 (2000)","journal-title":"Econometrica"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Kakade, S.M., Tauman-Kalai, A., Ligett, K.: Playing Games with Approximation Algorithms. In: STOC, pp. 546\u2013555 (2007)","DOI":"10.1145\/1250790.1250870"},{"issue":"3","key":"6_CR23","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/j.jcss.2004.10.016","volume":"71","author":"A. Kalai","year":"2005","unstructured":"Kalai, A., Vempala, S.: Efficient Algorithms for Online Decision Problems. Journal of Computer and System Sciences\u00a071(3), 291\u2013307 (2005); An earlier version appeared in COLT (2003)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"6_CR24","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/j.jcss.2004.10.016","volume":"71","author":"A. Kalai","year":"2005","unstructured":"Kalai, A., Vempala, S.: Efficient Algorithms for On-Line Optimization. J. of Computer Systems and Science (JCSS)\u00a071(3), 291\u2013307 (2005); (A preliminary version appeared in COLT 2003)","journal-title":"J. of Computer Systems and Science (JCSS)"},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/0196-8858(85)90002-8","volume":"6","author":"T.L. Lai","year":"1985","unstructured":"Lai, T.L., Robbins, H.: Asymptotically Efficient Adaptive Allocations Rules. Advances in Applied Mathmatics\u00a06, 4\u201322 (1985)","journal-title":"Advances in Applied Mathmatics"},{"key":"6_CR26","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0899-8256(03)00032-0","volume":"42","author":"E. Lehrer","year":"2003","unstructured":"Lehrer, E.: A Wide Range No-Regret Theorem. Games and Economic Behavior\u00a042, 101\u2013115 (2003)","journal-title":"Games and Economic Behavior"},{"key":"6_CR27","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":"6_CR28","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1090\/S0002-9904-1952-09620-8","volume":"58","author":"H. Robbins","year":"1952","unstructured":"Robbins, H.: Some Aspects of the Sequential Design of Experiments. Bulletin of the American Mathematical Society\u00a058, 527\u2013535 (1952)","journal-title":"Bulletin of the American Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2010: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11266-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,10]],"date-time":"2019-03-10T17:53:39Z","timestamp":1552240419000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11266-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642112652","9783642112669"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11266-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}