{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:43:39Z","timestamp":1742953419190,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319463780"},{"type":"electronic","value":"9783319463797"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-46379-7_19","type":"book-chapter","created":{"date-parts":[[2016,9,20]],"date-time":"2016-09-20T10:54:33Z","timestamp":1474368873000},"page":"276-287","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Combinatorial Metrical Task System Problem Under the Uniform Metric"],"prefix":"10.1007","author":[{"given":"Takumi","family":"Nakazono","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ken-ichiro","family":"Moridomi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kohei","family":"Hatano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eiji","family":"Takimoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,21]]},"reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science (LNCS)","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-642-16108-7_23","volume-title":"Algorithmic Learning Theory","author":"J Abernethy","year":"2010","unstructured":"Abernethy, J., Bartlett, P.L., Buchbinder, N., Stanton, I.: A regularization approach to metrical task systems. In: Hutter, M., Stephan, F., Vovk, V., Zeugmann, T. (eds.) ALT 2015. Lecture Notes in Artificial Intelligence (LNAI), vol. 6331, pp. 270\u2013284. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-16108-7_23"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science (LNCS)","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-319-11662-4_16","volume-title":"Algorithmic Learning Theory","author":"N Ailon","year":"2014","unstructured":"Ailon, N., Hatano, K., Takimoto, E.: Bandit online optimization over the permutahedron. In: Auer, P., Clark, A., Zeugmann, T., Zilles, S. (eds.) ALT 2015. Lecture Notes in Artificial Intelligence (LNAI), vol. 8776, pp. 215\u2013229. Springer, Heidelberg (2014). doi:10.1007\/978-3-319-11662-4_16"},{"issue":"5","key":"19_CR3","doi-asserted-by":"publisher","first-page":"40:1","DOI":"10.1145\/2783434","volume":"62","author":"N Bansal","year":"2015","unstructured":"Bansal, N., Buchbinder, N., Madry, A., Naor, J.S.: A polylogarithmic-competitive algorithm for the k-server problem. J. ACM 62(5), 40:1\u201340:49 (2015)","journal-title":"J. ACM"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Blum, A., Burch, C., Tomkins, A.: A polylog(n)-competitive algorithm for metrical task systems. In: Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing, STOC 1997, pp. 711\u2013719. ACM, New York (1997)","DOI":"10.1145\/258533.258667"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Bollobas, B., Mendel, M.: A Ramsey-type theorem for metric spaces and its applications for metrical task systems and related problems. In: Proceedings of 42nd IEEE Symposium on Foundations of Computer Science, pp. 396\u2013405, October 2001","DOI":"10.1109\/SFCS.2001.959914"},{"key":"19_CR6","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, pp. 1\u20138. Society for Industrial and Applied Mathematics, Philadelphia (2002)"},{"key":"19_CR7","volume-title":"Online Computation and Competitive Analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, New York (1998)"},{"issue":"4","key":"19_CR8","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1145\/146585.146588","volume":"39","author":"A Borodin","year":"1992","unstructured":"Borodin, A., Linial, N., Saks, M.E.: An optimal on-line algorithm for metrical task system. J. ACM 39(4), 745\u2013763 (1992)","journal-title":"J. ACM"},{"issue":"2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1287\/moor.2015.0742","volume":"41","author":"N Buchbinder","year":"2016","unstructured":"Buchbinder, N., Chen, S., Naor, J.S., Shamir, O.: Unified algorithms for online learning and competitive analysis. Math. Oper. Res. 41(2), 612\u2013625 (2016)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"19_CR10","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1016\/j.jcss.2012.01.001","volume":"78","author":"N Cesa-Bianchi","year":"2012","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Combinaotrial bandits. J. Comput. Syst. Sci. 78(5), 1404\u20131422 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"19_CR11","doi-asserted-by":"publisher","first-page":"1403","DOI":"10.1137\/S0097539700376159","volume":"32","author":"A Fiat","year":"2003","unstructured":"Fiat, A., Mendel, M.: Better algorithms for unfair metrical task systems and applications. SIAM J. Comput. 32(6), 1403\u20131422 (2003)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"19_CR12","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y Freund","year":"1997","unstructured":"Freund, Y., Schapire, R.E.: A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci. 55(1), 119\u2013139 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-662-43948-7_47","volume-title":"Automata, Languages, and Programming","author":"A Gupta","year":"2014","unstructured":"Gupta, A., Talwar, K., Wieder, U.: Changing bases: multistage optimization for matroids and matchings. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2015. LNCS, vol. 8572, pp. 563\u2013575. Springer, Heidelberg (2014). doi:10.1007\/978-3-662-43948-7_47"},{"issue":"12","key":"19_CR14","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0304-3975(97)00006-6","volume":"194","author":"S Irani","year":"1998","unstructured":"Irani, S., Seiden, S.: Randomized algorithms for metrical task systems. Theor. Comput. Sci. 194(12), 163\u2013182 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1145\/1008731.1008738","volume":"51","author":"M Jerrum","year":"2004","unstructured":"Jerrum, M., Sinclair, A., Vigoda, E.: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM 51, 671\u2013697 (2004)","journal-title":"J. ACM"},{"issue":"3","key":"19_CR16","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. 71(3), 291\u2013307 (2005)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"19_CR17","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1145\/210118.210128","volume":"42","author":"E Koutsoupias","year":"1995","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: On the k-server conjecture. J. ACM 42(5), 971\u2013983 (1995)","journal-title":"J. ACM"},{"issue":"5","key":"19_CR18","first-page":"773","volume":"4","author":"E Takimoto","year":"2004","unstructured":"Takimoto, E., Warmuth, M.K.: Path kernels and multiplicative updates. J. Mach. Learn. Res. 4(5), 773\u2013818 (2004)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46379-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T14:06:39Z","timestamp":1710165999000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-46379-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319463780","9783319463797"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46379-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"21 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Learning Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bari","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"alt2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}