{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:01Z","timestamp":1772164021713,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,17]],"date-time":"2013-06-17T00:00:00Z","timestamp":1371427200000},"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":[[2013,6,17]]},"DOI":"10.1145\/2465529.2465533","type":"proceedings-article","created":{"date-parts":[[2013,6,18]],"date-time":"2013-06-18T08:36:08Z","timestamp":1371544568000},"page":"329-330","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["A tale of two metrics"],"prefix":"10.1145","author":[{"given":"Lachlan","family":"Andrew","sequence":"first","affiliation":[{"name":"Swinburne University of Technology, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siddharth","family":"Barman","sequence":"additional","affiliation":[{"name":"Caltech, Pasadena, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katrina","family":"Ligett","sequence":"additional","affiliation":[{"name":"Caltech, Pasadena, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minghong","family":"Lin","sequence":"additional","affiliation":[{"name":"Caltech, Pasadena, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Meyerson","sequence":"additional","affiliation":[{"name":"Google Inc., Mountain View, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Roytman","sequence":"additional","affiliation":[{"name":"UCLA, Los Angeles, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Wierman","sequence":"additional","affiliation":[{"name":"Caltech, Pasadena, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007621832648"},{"key":"e_1_3_2_1_2_1","volume-title":"Conf. on Learning Techniques (COLT)","author":"Buchbinder N.","year":"2012","unstructured":"N. Buchbinder , S. Chen , J. Naor , and O. Shamir , \" Unified algorithms for online learning and competitive analysis,\" in Proc . Conf. on Learning Techniques (COLT) , 2012 . N. Buchbinder, S. Chen, J. Naor, and O. Shamir, \"Unified algorithms for online learning and competitive analysis,\" in Proc. Conf. on Learning Techniques (COLT), 2012."},{"key":"e_1_3_2_1_3_1","first-page":"1","article-title":"Static optimality and dynamic search-optimality in lists and trees","author":"Blum A.","year":"2002","unstructured":"A. Blum , S. Chawla , and A. Kalai , \" Static optimality and dynamic search-optimality in lists and trees ,\" in Proceedings of SODA , 2002 , pp. 1 -- 8 . A. Blum, S. Chawla, and A. Kalai, \"Static optimality and dynamic search-optimality in lists and trees,\" in Proceedings of SODA, 2002, pp. 1--8.","journal-title":"Proceedings of SODA"},{"key":"e_1_3_2_1_4_1","first-page":"450","article-title":"Finely-competitive paging","author":"Blum A.","year":"1999","unstructured":"A. Blum , C. Burch , and A. Kalai , \" Finely-competitive paging ,\" in Proceedings of FOCS , 1999 , pp. 450 -- 457 . A. Blum, C. Burch, and A. Kalai, \"Finely-competitive paging,\" in Proceedings of FOCS, 1999, pp. 450--457.","journal-title":"Proceedings of FOCS"},{"key":"e_1_3_2_1_5_1","first-page":"270","article-title":"A regularization approach to metrical task systems","author":"Abernethy J.","year":"2010","unstructured":"J. Abernethy , P. Bartlett , N. Buchbinder , and I. Stanton , \" A regularization approach to metrical task systems ,\" in Proceedings of ALT , 2010 , pp. 270 -- 284 . J. Abernethy, P. Bartlett, N. Buchbinder, and I. Stanton, \"A regularization approach to metrical task systems,\" in Proceedings of ALT, 2010, pp. 270--284.","journal-title":"Proceedings of ALT"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553425"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11503415_42"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267772"},{"key":"e_1_3_2_1_9_1","first-page":"928","volume-title":"Int. Conf. Machine Learning (ICML), T. Fawcett and N. Mishra, Eds. AAAI Press","author":"Zinkevich M.","year":"2003","unstructured":"M. Zinkevich , \"Online convex programming and generalized infinitesimal gradient ascent,\" in Proc . Int. Conf. Machine Learning (ICML), T. Fawcett and N. Mishra, Eds. AAAI Press , 2003 , pp. 928 -- 936 . M. Zinkevich, \"Online convex programming and generalized infinitesimal gradient ascent,\" in Proc. Int. Conf. Machine Learning (ICML), T. Fawcett and N. Mishra, Eds. AAAI Press, 2003, pp. 928--936."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5016-8"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934885"}],"event":{"name":"SIGMETRICS '13: ACM SIGMETRICS \/ International Conference on Measurement and Modeling of Computer Systems","location":"Pittsburgh PA USA","acronym":"SIGMETRICS '13","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation"]},"container-title":["Proceedings of the ACM SIGMETRICS\/international conference on Measurement and modeling of computer systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2465529.2465533","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2465529.2465533","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:36Z","timestamp":1750220316000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2465529.2465533"}},"subtitle":["simultaneous bounds on competitiveness and regret"],"short-title":[],"issued":{"date-parts":[[2013,6,17]]},"references-count":11,"alternative-id":["10.1145\/2465529.2465533","10.1145\/2465529"],"URL":"https:\/\/doi.org\/10.1145\/2465529.2465533","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2494232.2465533","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,6,17]]},"assertion":[{"value":"2013-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}