{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:41:46Z","timestamp":1742989306049,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030677305"},{"type":"electronic","value":"9783030677312"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-67731-2_15","type":"book-chapter","created":{"date-parts":[[2021,1,20]],"date-time":"2021-01-20T10:05:07Z","timestamp":1611137107000},"page":"203-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved Algorithms for Online Load Balancing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8588-4543","authenticated-orcid":false,"given":"Yaxiong","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1536-1269","authenticated-orcid":false,"given":"Kohei","family":"Hatano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9542-2553","authenticated-orcid":false,"given":"Eiji","family":"Takimoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,11]]},"reference":[{"key":"15_CR1","unstructured":"Abernethy, J., Bartlett, P.L., Hazan, E.: Blackwell approachability and no-regret learning are equivalent. In: Proceedings of the 24th Annual Conference on Learning Theory, pp. 27\u201346 (2011)"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/BFb0029569","volume-title":"Online Algorithms","author":"Y Azar","year":"1998","unstructured":"Azar, Y.: On-line load balancing. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms. LNCS, vol. 1442, pp. 178\u2013195. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0029569"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-57155-8_241","volume-title":"Algorithms and Data Structures","author":"Y Azar","year":"1993","unstructured":"Azar, Y., Kalyanasundaram, B., Plotkin, S., Pruhs, K.R., Waarts, O.: Online load balancing of temporary tasks. In: Dehne, F., Sack, J.-R., Santoro, N., Whitesides, S. (eds.) WADS 1993. LNCS, vol. 709, pp. 119\u2013130. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57155-8_241"},{"issue":"1","key":"15_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2140\/pjm.1956.6.1","volume":"6","author":"D Blackwell","year":"1956","unstructured":"Blackwell, D., et al.: An analog of the minimax theorem for vector payoffs. Pac. J. Math. 6(1), 1\u20138 (1956)","journal-title":"Pac. J. Math."},{"issue":"1","key":"15_CR5","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.jda.2006.02.001","volume":"5","author":"P Crescenzi","year":"2007","unstructured":"Crescenzi, P., Gambosi, G., Nicosia, G., Penna, P., Unger, W.: On-line load balancing made simple: greedy strikes back. J. Discrete Algorithms 5(1), 162\u2013175 (2007)","journal-title":"J. Discrete Algorithms"},{"key":"15_CR6","unstructured":"Even-Dar, E., Kleinberg, R., Mannor, S., Mansour, Y.: Online learning for global cost functions. In: COLT (2009)"},{"key":"15_CR7","unstructured":"Hazan, E.: Introduction to online convex optimization. Found. Trends Optim. 2(3\u20134), 157\u2013325 (2016). http:\/\/ocobool.cs.prinston.edu\/"},{"key":"15_CR8","unstructured":"Hoeven, D., Erven, T., Kot\u0142owski, W.: The many faces of exponential weights in online learning. In: Conference On Learning Theory, pp. 2067\u20132092 (2018)"},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1996.2612","volume":"132","author":"J Kivinen","year":"1997","unstructured":"Kivinen, J., Warmuth, M.K.: Exponentiated gradient versus gradient descent for linear predictors. Inf. Comput. 132(1), 1\u201363 (1997)","journal-title":"Inf. Comput."},{"key":"15_CR10","unstructured":"Kwon, J.: Refined approachability algorithms and application to regret minimization with global costs. arXiv preprint arXiv:2009.03831 (2020)"},{"issue":"1\u20133","key":"15_CR11","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0024-3795(98)10032-0","volume":"284","author":"MS Lobo","year":"1998","unstructured":"Lobo, M.S., Vandenberghe, L., Boyd, S., Lebret, H.: Applications of second-order cone programming. Linear Algebra Appl. 284(1\u20133), 193\u2013228 (1998)","journal-title":"Linear Algebra Appl."},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Molinaro, M.: Online and random-order load balancing simultaneously. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1638\u20131650. Society for Industrial and Applied Mathematics (2017)","DOI":"10.1137\/1.9781611974782.108"},{"key":"15_CR13","unstructured":"Rakhlin, A., Sridharan, K., Tewari, A.: Online learning: beyond regret. In: Proceedings of the 24th Annual Conference on Learning Theory, pp. 559\u2013594 (2011)"},{"key":"15_CR14","unstructured":"Shalev-Shwartz, S.: Online learning and online convex optimization. Found. Trends\u00ae Mach. Learn. 4(2), 107\u2013194 (2012)"},{"issue":"1","key":"15_CR15","first-page":"4434","volume":"17","author":"N Shimkin","year":"2016","unstructured":"Shimkin, N.: An online convex optimization approach to blackwell\u2019s approachability. J. Mach. Learn. Res. 17(1), 4434\u20134456 (2016)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2021: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67731-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T22:02:09Z","timestamp":1619301729000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-67731-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030677305","9783030677312"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67731-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bolzano-Bozen","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"47","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem2021.inf.unibz.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}