{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:29:12Z","timestamp":1750220952544,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T00:00:00Z","timestamp":1561248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1749609, CCF-1740551 and DMS-1839116"],"award-info":[{"award-number":["CCF-1749609, CCF-1740551 and DMS-1839116"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,23]]},"DOI":"10.1145\/3313276.3316314","type":"proceedings-article","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T12:19:08Z","timestamp":1561033148000},"page":"861-868","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Competitively chasing convex bodies"],"prefix":"10.1145","author":[{"given":"S\u00e9bastien","family":"Bubeck","sequence":"first","affiliation":[{"name":"Microsoft Research, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yin Tat","family":"Lee","sequence":"additional","affiliation":[{"name":"University of Washington, USA \/ Microsoft Research, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanzhi","family":"Li","sequence":"additional","affiliation":[{"name":"Stanford University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Sellke","sequence":"additional","affiliation":[{"name":"Stanford University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,23]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"Lecture Notes in Comput","first-page":"81","volume-title":"LATIN 2016: theoretical informatics","author":"Antoniadis Antonios","unstructured":"Antonios Antoniadis , Neal Barcelo , Michael Nugent , Kirk Pruhs , Kevin Schewior , and Michele Scquizzato . Chasing convex bodies and functions . In LATIN 2016: theoretical informatics , volume 9644 of Lecture Notes in Comput . Sci ., pages 68\u2013 81 . Springer, Berlin, 2016. Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Kevin Schewior, and Michele Scquizzato. Chasing convex bodies and functions. In LATIN 2016: theoretical informatics, volume 9644 of Lecture Notes in Comput. Sci., pages 68\u201381. Springer, Berlin, 2016."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/3310435.3310443"},{"key":"e_1_3_2_1_3_1","first-page":"1260","volume-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Bansal Nikhil","unstructured":"Nikhil Bansal , Martin B\u00f6hm , Marek Eli\u00e1\u0161 , Grigorios Koumoutsos , and Seeun William Umboh . Nested convex bodies are chaseable . In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms , pages 1253\u2013 1260 . SIAM, 2018. Nikhil Bansal, Martin B\u00f6hm, Marek Eli\u00e1\u0161, Grigorios Koumoutsos, and Seeun William Umboh. Nested convex bodies are chaseable. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1253\u20131260. SIAM, 2018."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008733"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188798"},{"key":"e_1_3_2_1_6_1","volume-title":"Chasing nested convex bodies nearly optimally","author":"Bubeck S\u00e9bastien","year":"2018","unstructured":"S\u00e9bastien Bubeck , Yin-Tat Lee , Yuanzhi Li , and Mark Sellke . Chasing nested convex bodies nearly optimally . 2018 . S\u00e9bastien Bubeck, Yin-Tat Lee, Yuanzhi Li, and Mark Sellke. Chasing nested convex bodies nearly optimally. 2018."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634106"},{"key":"e_1_3_2_1_8_1","series-title":"Proceedings of Machine Learning Research","first-page":"1594","volume-title":"Proceedings of the 31st Conference On Learning Theory","author":"Chen Niangjun","unstructured":"Niangjun Chen , Gautam Goel , and Adam Wierman . Smoothed online convex optimization in high dimensions via online balanced descent . In Proceedings of the 31st Conference On Learning Theory , volume 75 of Proceedings of Machine Learning Research , pages 1574\u2013 1594 . PMLR, 2018. Niangjun Chen, Gautam Goel, and Adam Wierman. Smoothed online convex optimization in high dimensions via online balanced descent. In Proceedings of the 31st Conference On Learning Theory, volume 75 of Proceedings of Machine Learning Research, pages 1574\u20131594. PMLR, 2018."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02189324"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1561\/2400000013"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574061"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00049"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2226216"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90003-W"}],"event":{"name":"STOC '19: 51st Annual ACM SIGACT Symposium on the Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Phoenix AZ USA","acronym":"STOC '19"},"container-title":["Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316314","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3313276.3316314","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3313276.3316314","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:00Z","timestamp":1750204440000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,23]]},"references-count":14,"alternative-id":["10.1145\/3313276.3316314","10.1145\/3313276"],"URL":"https:\/\/doi.org\/10.1145\/3313276.3316314","relation":{},"subject":[],"published":{"date-parts":[[2019,6,23]]},"assertion":[{"value":"2019-06-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}