{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:18Z","timestamp":1763467998755},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407201"},{"type":"electronic","value":"9783540451679"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45167-9_4","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T19:10:53Z","timestamp":1279825853000},"page":"26-40","source":"Crossref","is-referenced-by-count":21,"title":["Efficient Algorithms for Online Decision Problems"],"prefix":"10.1007","author":[{"given":"Adam","family":"Kalai","sequence":"first","affiliation":[]},{"given":"Santosh","family":"Vempala","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Blum, A.: On-line algorithms in machine learning. Technical Report CMU-CS-97- 163, Carnegie Mellon University (1997)"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1023\/A:1007621832648","volume":"39","author":"A. Blum","year":"2000","unstructured":"Blum, A., Burch, C.: On-line learning and the metrical task system problem. Machine Learning\u00a039(1), 35\u201358 (2000)","journal-title":"Machine Learning"},{"key":"4_CR3","unstructured":"Blum, A., Chawla, S., Kalai, A.: Static Optimality and Dynamic Search Optimality in Lists and Trees. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002) (2002)"},{"issue":"3","key":"4_CR4","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., Haussler, D., Helmbold, D., Schapire, R., Warmuth, M.: How to use expert advice. Journal of the ACM\u00a044(3), 427\u2013485 (1997)","journal-title":"Journal of the ACM"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.1467-9965.1991.tb00002.x","volume":"1","author":"T. Cover","year":"1991","unstructured":"Cover, T.: Universal Portfolios. Math. Finance\u00a01, 1\u201329 (1991)","journal-title":"Math. Finance"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Freund, Y., Schapire, R., Singer, Y., Warmuth, M.: Using and combining predictors that specialize. In: Proceedings of the 29\n                      th\n                     Annual ACM Symposium on the Theory of Computing, pp. 334\u2013343 (1997)","DOI":"10.1145\/258533.258616"},{"key":"4_CR7","first-page":"1084","volume":"29","author":"D. Foster","year":"1999","unstructured":"Foster, D., Vohra, R.: Regret in the on-line decision problem. Games and Economic Behavior\u00a029, 1084\u20131090 (1999)","journal-title":"Games and Economic Behavior"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M. Goemans","year":"1995","unstructured":"Goemans, M., Williamson, D.: Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming. J. ACM\u00a042, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"4_CR9","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":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1023\/A:1007396710653","volume":"27","author":"D. Helmbold","year":"1997","unstructured":"Helmbold, D., Schapire, R.: Predicting nearly as well as the best pruning of a decision tree. Machine Learning\u00a027(1), 51\u201368 (1997)","journal-title":"Machine Learning"},{"key":"4_CR11","unstructured":"Kalai, A., Vempala, S.: Geometric algorithms for online optimization. MIT Technical report MIT-LCS-TR-861 (2002)"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0196-6774(85)90036-7","volume":"2","author":"D. Knuth","year":"1985","unstructured":"Knuth, D.: Dynamic Huffman Coding. J. Algorithms\u00a02, 163\u2013180 (1985)","journal-title":"J. Algorithms"},{"key":"4_CR13","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":"4_CR14","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. Sleator","year":"1985","unstructured":"Sleator, D., Tarjan, R.: Amortized efficiency of list update and paging rules. Communications of the ACM\u00a028, 202\u2013208 (1985)","journal-title":"Communications of the ACM"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D. Sleator","year":"1985","unstructured":"Sleator, D., Tarjan, R.: Self-Adjusting Binary Search Trees. Journal of the ACM\u00a032, 652\u2013686 (1985)","journal-title":"Journal of the ACM"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Takimoto, E., Warmuth, M.: Path Kernels and Multiplicative Updates. In: Proceedings of the Thirteenth Annual Conference on Computational Learning Theory, pp. 74\u201389 (2002)","DOI":"10.1007\/3-540-45435-7_6"},{"issue":"2","key":"4_CR17","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0304-3975(01)00401-7","volume":"288","author":"E. Takimoto","year":"2002","unstructured":"Takimoto, E., Warmuth, M.: Predicting Nearly as Well as the Best Pruning of a Planar Decision Graph. Theoretical Computer Science\u00a0288(2), 217\u2013235 (2002)","journal-title":"Theoretical Computer Science"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Vovk, V.: Aggregating strategies. In: Proc. 3rd Ann. Workshop on Computational Learning Theory, pp. 371\u2013383 (1990)","DOI":"10.1016\/B978-1-55860-146-8.50032-1"},{"key":"4_CR19","unstructured":"Zinkevich, M.: Online Convex Programming and Generalized Infinitesimal Gradient Ascent. CMU Technical Report CMU-CS-03-110 (2003)"}],"container-title":["Lecture Notes in Computer Science","Learning Theory and Kernel Machines"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45167-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T04:33:51Z","timestamp":1552797231000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45167-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407201","9783540451679"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45167-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}