{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:10:29Z","timestamp":1740103829634,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,11,15]],"date-time":"2022-11-15T00:00:00Z","timestamp":1668470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,15]],"date-time":"2022-11-15T00:00:00Z","timestamp":1668470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s10951-022-00770-6","type":"journal-article","created":{"date-parts":[[2022,11,15]],"date-time":"2022-11-15T12:03:01Z","timestamp":1668513781000},"page":"443-455","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Well-behaved online load balancing against strategic jobs"],"prefix":"10.1007","volume":"26","author":[{"given":"Bo","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5766-2115","authenticated-orcid":false,"given":"Xiaowei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,15]]},"reference":[{"key":"770_CR1","doi-asserted-by":"crossref","unstructured":"Andelman, N., Azar, Y., & Sorani, M. (2005). Truthful approximation mechanisms for scheduling selfish related machines. In STACS, volume 3404 of Lecture Notes in Computer Science (pp. 69\u201382). Springer.","DOI":"10.1007\/978-3-540-31856-9_6"},{"issue":"3","key":"770_CR2","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J Aspnes","year":"1997","unstructured":"Aspnes, J., Azar, Y., Fiat, A., Plotkin, S. A., & Waarts, O. (1997). On-line routing of virtual circuits with applications to load balancing and machine scheduling. Journal of ACM, 44(3), 486\u2013504.","journal-title":"Journal of ACM"},{"issue":"1","key":"770_CR3","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1006\/jagm.1999.1070","volume":"35","author":"P Berman","year":"2000","unstructured":"Berman, P., Charikar, M., & Karpinski, M. (2000). On-line load balancing for related machines. Journal of Algorithms, 35(1), 108\u2013121.","journal-title":"Journal of Algorithms"},{"key":"770_CR4","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A.\u00a0D., Shah, N., & Wang, J. (2016). The unreasonable fairness of maximum nash welfare. In EC (pp. 305\u2013322). ACM.","DOI":"10.1145\/2940716.2940726"},{"issue":"4","key":"770_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0167-6377(97)00040-0","volume":"21","author":"B Chen","year":"1997","unstructured":"Chen, B., & Vestjens, A. P. A. (1997). Scheduling on identical machines: How good is LPT in an on-line setting? Operations Research Letters, 21(4), 165\u2013169.","journal-title":"Operations Research Letters"},{"issue":"4","key":"770_CR6","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s00453-008-9165-3","volume":"55","author":"G Christodoulou","year":"2009","unstructured":"Christodoulou, G., Koutsoupias, E., & Vidali, A. (2009). A lower bound for scheduling mechanisms. Algorithmica, 55(4), 729\u2013740.","journal-title":"Algorithmica"},{"issue":"4","key":"770_CR7","doi-asserted-by":"publisher","first-page":"1572","DOI":"10.1137\/120866038","volume":"42","author":"G Christodoulou","year":"2013","unstructured":"Christodoulou, G., & Kov\u00e1cs, A. (2013). A deterministic truthful PTAS for scheduling related machines. SIAM Journal on Computing, 42(4), 1572\u20131595.","journal-title":"SIAM Journal on Computing"},{"key":"770_CR8","doi-asserted-by":"crossref","unstructured":"Dutot, P.-F., Pascual, F., Rzadca, K., & Trystram, D. (2011). Approximation algorithms for the multiorganization scheduling problem. IEEE Transactions on Parallel and Distributed Systems, 22(11), 1888\u20131895.","DOI":"10.1109\/TPDS.2011.47"},{"key":"770_CR9","doi-asserted-by":"crossref","unstructured":"Epstein, L., Levin, A., & van Stee, R. (2016). A unified approach to truthful scheduling on related machines. Mathematics of Operations Research, 41(1), 332\u2013351.","DOI":"10.1287\/moor.2015.0730"},{"key":"770_CR10","doi-asserted-by":"crossref","unstructured":"Feldman, M., Fiat, A., & Roytman, A. (2017). Makespan minimization via posted prices. In EC (pp. 405\u2013422). ACM.","DOI":"10.1145\/3033274.3085129"},{"key":"770_CR11","doi-asserted-by":"crossref","unstructured":"Fleischer, R., & Wahl, M. (2000). Online scheduling revisited. In ESA, volume 1879 of Lecture Notes in Computer Science (pp. 202\u2013210). Springer.","DOI":"10.1007\/3-540-45253-2_19"},{"key":"770_CR12","doi-asserted-by":"crossref","unstructured":"Freeman, R., Shah, N., & Vaish, R. (2020). Best of both worlds: Ex-ante and ex-post fairness in resource allocation. In EC (pp. 21\u201322). ACM.","DOI":"10.1145\/3391403.3399537"},{"issue":"2","key":"770_CR13","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics, 17(2), 416\u2013429.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"770_CR14","doi-asserted-by":"crossref","unstructured":"Hartline, J.D., & Roughgarden, T. (2009). Simple versus optimal mechanisms. In EC (pp. 225\u2013234). ACM.","DOI":"10.1145\/1566374.1566407"},{"key":"770_CR15","unstructured":"Huang, Z., Kang, N., Tang, Z.\u00a0G., Wu, X., & Zhang, Y. (2018). Online makespan minimization: The power of restart. In APPROX-RANDOM, volume 116 of LIPIcs (pp. 14:1\u201314:19). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik."},{"issue":"1","key":"770_CR16","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s00453-012-9634-6","volume":"66","author":"E Koutsoupias","year":"2013","unstructured":"Koutsoupias, E., & Vidali, A. (2013). A lower bound of 1+$${\\varphi }$$ for truthful scheduling mechanisms. Algorithmica, 66(1), 211\u2013223.","journal-title":"Algorithmica"},{"key":"770_CR17","doi-asserted-by":"crossref","unstructured":"Kov\u00e1cs, A. (2005). Fast monotone 3-approximation algorithm for scheduling related machines. In ESA, volume 3669 of Lecture Notes in Computer Science (pp. 616\u2013627). Springer.","DOI":"10.1007\/11561071_55"},{"key":"770_CR18","doi-asserted-by":"crossref","unstructured":"Nisan, Noam, & Ronen, Amir. (1999). Algorithmic mechanism design (extended abstract). In STOC (pp. 129\u2013140). ACM.","DOI":"10.1145\/301250.301287"},{"key":"770_CR19","volume-title":"Algorithmic game theory","author":"N Noam","year":"2007","unstructured":"Noam, N., Roughgarden, T., Tardos, E., & Vazirani, V. V. (2007). Algorithmic game theory. Cambridge University Press."},{"issue":"1","key":"770_CR20","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(00)00264-4","volume":"268","author":"J Noga","year":"2001","unstructured":"Noga, J., & Seiden, S. S. (2001). An optimal online algorithm for scheduling two machines with release times. Theoretical Computer Science, 268(1), 133\u2013143.","journal-title":"Theoretical Computer Science"},{"key":"770_CR21","doi-asserted-by":"crossref","unstructured":"Plaut, B., & Roughgarden, T. (2018). Almost envy-freeness with general valuations. In SODA (pp. 2584\u20132603). SIAM.","DOI":"10.1137\/1.9781611975031.165"},{"key":"770_CR22","doi-asserted-by":"crossref","unstructured":"Skowron, P., & Rzadca, K. (2013). Non-monetary fair scheduling: a cooperative game theory approach. In SPAA (pp. 288\u2013297). ACM.","DOI":"10.1145\/2486159.2486169"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00770-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-022-00770-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00770-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T09:07:07Z","timestamp":1694855227000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-022-00770-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,15]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["770"],"URL":"https:\/\/doi.org\/10.1007\/s10951-022-00770-6","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2022,11,15]]},"assertion":[{"value":"27 October 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}