{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T02:53:54Z","timestamp":1768272834954,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,5,31]],"date-time":"2014-05-31T00:00:00Z","timestamp":1401494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,5,31]]},"DOI":"10.1145\/2591796.2591868","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T12:01:58Z","timestamp":1443700918000},"page":"459-467","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["Bandits with switching costs"],"prefix":"10.1145","author":[{"given":"Ofer","family":"Dekel","sequence":"first","affiliation":[{"name":"Microsoft Research"}]},{"given":"Jian","family":"Ding","sequence":"additional","affiliation":[{"name":"University of Chicago"}]},{"given":"Tomer","family":"Koren","sequence":"additional","affiliation":[{"name":"Technion"}]},{"given":"Yuval","family":"Peres","sequence":"additional","affiliation":[{"name":"Microsoft Research"}]}],"member":"320","published-online":{"date-parts":[[2014,5,31]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Proceedings of the Twenty-Ninth International Conference on Machine Learning","author":"Arora R.","year":"2012","unstructured":"R. Arora , O. Dekel , and A. Tewari . Online bandit learning against an adaptive adversary: from regret to policy regret . In Proceedings of the Twenty-Ninth International Conference on Machine Learning , 2012 . R. Arora, O. Dekel, and A. Tewari. Online bandit learning against an adaptive adversary: from regret to policy regret. In Proceedings of the Twenty-Ninth International Conference on Machine Learning, 2012."},{"key":"e_1_3_2_2_2_1","first-page":"217","volume-title":"Proceedings of the 22th annual conference on learning theory (COLT)","author":"Audibert J.-Y.","year":"2009","unstructured":"J.-Y. Audibert , S. Bubeck , Minimax policies for adversarial and stochastic bandits . In Proceedings of the 22th annual conference on learning theory (COLT) , pages 217 -- 226 , 2009 . J.-Y. Audibert, S. Bubeck, et al. Minimax policies for adversarial and stochastic bandits. In Proceedings of the 22th annual conference on learning theory (COLT), pages 217--226, 2009."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1137817"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/258128.258179"},{"key":"e_1_3_2_2_6_1","first-page":"26","article-title":"Online learning with switching costs and other adaptive adversaries","author":"Cesa-Bianchi N.","year":"2013","unstructured":"N. Cesa-Bianchi , O. Dekel , and O. Shamir . Online learning with switching costs and other adaptive adversaries . In Advances in Neural Information Processing Systems 26 , 2013 . N. Cesa-Bianchi, O. Dekel, and O. Shamir. Online learning with switching costs and other adaptive adversaries. In Advances in Neural Information Processing Systems 26, 2013.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(89)90083-6"},{"key":"e_1_3_2_2_8_1","volume-title":"Elements of information theory","author":"Cover T.","year":"2006","unstructured":"T. Cover and J. Thomas . Elements of information theory . John Wiley & Sons , 2006 . T. Cover and J. Thomas. Elements of information theory. John Wiley & Sons, 2006."},{"key":"e_1_3_2_2_9_1","volume-title":"Proceedings of the Thirtieth International Conference on Machine Learning","author":"Dekel O.","year":"2013","unstructured":"O. Dekel and E. Hazan . Better rates for any adversarial deterministic MDP . In Proceedings of the Thirtieth International Conference on Machine Learning , 2013 . O. Dekel and E. Hazan. Better rates for any adversarial deterministic MDP. In Proceedings of the Thirtieth International Conference on Machine Learning, 2013."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1504"},{"key":"e_1_3_2_2_11_1","first-page":"132","volume-title":"Proceedings of the 23rd International Conference on Learning Theory","author":"Geulen S.","year":"2010","unstructured":"S. Geulen , B. V\u00f6cking , and M. Winkler . Regret minimization for online buffering problems using the weighted majority algorithm . In Proceedings of the 23rd International Conference on Learning Theory , pages 132 -- 143 , 2010 . S. Geulen, B. V\u00f6cking, and M. Winkler. Regret minimization for online buffering problems using the weighted majority algorithm. In Proceedings of the 23rd International Conference on Learning Theory, pages 132--143, 2010."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033954"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.10.016"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1009"},{"key":"e_1_3_2_2_15_1","first-page":"1804","volume-title":"Advances in Neural Information Processing Systems 23","author":"Neu G.","year":"2010","unstructured":"G. Neu , A. Gy\u00f6rgy , C. Szepesv\u00e1ri , and A. Antos . Online Markov decision processes under bandit feedback . In Advances in Neural Information Processing Systems 23 , pages 1804 -- 1812 , 2010 . G. Neu, A. Gy\u00f6rgy, C. Szepesv\u00e1ri, and A. Antos. Online Markov decision processes under bandit feedback. In Advances in Neural Information Processing Systems 23, pages 1804--1812, 2010."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.24"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1090.0397"}],"event":{"name":"STOC '14: Symposium on Theory of Computing","location":"New York New York","acronym":"STOC '14","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591868","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2591796.2591868","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:55:45Z","timestamp":1750229745000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591868"}},"subtitle":["<i>T<\/i>\n            <sup>2\/3<\/sup>\n            regret"],"short-title":[],"issued":{"date-parts":[[2014,5,31]]},"references-count":17,"alternative-id":["10.1145\/2591796.2591868","10.1145\/2591796"],"URL":"https:\/\/doi.org\/10.1145\/2591796.2591868","relation":{},"subject":[],"published":{"date-parts":[[2014,5,31]]},"assertion":[{"value":"2014-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}