{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:49:49Z","timestamp":1725454189689},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642341052"},{"type":"electronic","value":"9783642341069"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34106-9_23","type":"book-chapter","created":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T01:56:27Z","timestamp":1349056587000},"page":"275-289","source":"Crossref","is-referenced-by-count":1,"title":["Lower Bounds on Individual Sequence Regret"],"prefix":"10.1007","author":[{"given":"Eyal","family":"Gofer","sequence":"first","affiliation":[]},{"given":"Yishay","family":"Mansour","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511804441"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Prediction, Learning, and Games. Cambridge University Press (2006)","DOI":"10.1017\/CBO9780511546921"},{"issue":"2-3","key":"23_CR3","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10994-006-5001-7","volume":"66","author":"N. Cesa-Bianchi","year":"2007","unstructured":"Cesa-Bianchi, N., Mansour, Y., Stoltz, G.: Improved second-order bounds for prediction with expert advice. Machine Learning\u00a066(2-3), 321\u2013352 (2007)","journal-title":"Machine Learning"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"DeMarzo, P., Kremer, I., Mansour, Y.: Online trading algorithms and robust option pricing. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 477\u2013486 (2006)","DOI":"10.1145\/1132516.1132586"},{"issue":"1-2","key":"23_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10994-008-5060-z","volume":"72","author":"E. Even-Dar","year":"2008","unstructured":"Even-Dar, E., Kearns, M., Mansour, Y., Wortman, J.: Regret to the best vs. regret to the average. Machine Learning\u00a072(1-2), 21\u201337 (2008)","journal-title":"Machine Learning"},{"key":"23_CR6","unstructured":"Gofer, E., Mansour, Y.: Lower bounds on individual sequence regret, http:\/\/www.cs.tau.ac.il\/~eyalgofe\/papers\/indivseq_full.pdf"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-24829-0_24","volume-title":"Algorithmic Game Theory","author":"E. Gofer","year":"2011","unstructured":"Gofer, E., Mansour, Y.: Pricing Exotic Derivatives Using Regret Minimization. In: Persiano, G. (ed.) SAGT 2011. LNCS, vol.\u00a06982, pp. 266\u2013277. Springer, Heidelberg (2011)"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Hazan, E.: Efficient algorithms for online convex optimization and their applications. Ph.D. thesis, Princeton University (2006)","DOI":"10.1007\/11776420_37"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Hazan, E.: The convex optimization approach to regret minimization. In: Sra, S., Nowozin, S., Wright, S.J. (eds.) Optimization for Machine Learning. MIT Press (2011)","DOI":"10.7551\/mitpress\/8996.003.0012"},{"issue":"2-3","key":"23_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10994-010-5175-x","volume":"80","author":"E. Hazan","year":"2010","unstructured":"Hazan, E., Kale, S.: Extracting certainty from uncertainty: regret bounded by variation in costs. Machine Learning\u00a080(2-3), 165\u2013188 (2010)","journal-title":"Machine Learning"},{"issue":"3","key":"23_CR11","doi-asserted-by":"publisher","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. J. Comput. Syst. Sci.\u00a071(3), 291\u2013307 (2005); Special issue Learning Theory 2003","journal-title":"J. Comput. Syst. Sci."},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer Academic Publishers (2004)","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press (1970)","DOI":"10.1515\/9781400873173"},{"key":"23_CR14","unstructured":"Zinkevich, M.: Online convex programming and generalized infinitesimal gradient ascent. In: ICML, pp. 928\u2013936 (2003)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34106-9_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T20:53:41Z","timestamp":1687726421000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34106-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341052","9783642341069"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34106-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}