{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T01:47:53Z","timestamp":1764812873650,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,6,16]],"date-time":"2018-06-16T00:00:00Z","timestamp":1529107200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771251"],"award-info":[{"award-number":["11771251"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["71771138"],"award-info":[{"award-number":["71771138"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s11590-018-1285-3","type":"journal-article","created":{"date-parts":[[2018,6,16]],"date-time":"2018-06-16T09:41:45Z","timestamp":1529142105000},"page":"949-959","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Improved price of anarchy for machine scheduling games with coordination mechanisms"],"prefix":"10.1007","volume":"13","author":[{"given":"Long","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuzhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingguo","family":"Bai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,16]]},"reference":[{"key":"1285_CR1","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Conference on Theoretical Aspects of Computer Science, pp. 404\u2013413. Springer (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"1285_CR2","doi-asserted-by":"publisher","first-page":"3327","DOI":"10.1016\/j.tcs.2009.01.005","volume":"410","author":"G Christodoulou","year":"2009","unstructured":"Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination mechanisms. Theor. Comput. Sci. 410, 3327\u20133336 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"1285_CR3","doi-asserted-by":"crossref","unstructured":"Ye, D., Zhang, G.: Coordination mechanisms for selfish parallel jobs scheduling. In: Theory and Applications of Models of Computation, pp. 225\u2013236. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-29952-0_25"},{"issue":"2","key":"1285_CR4","first-page":"1","volume":"33","author":"QQ Nong","year":"2016","unstructured":"Nong, Q.Q., Fan, G.Q., Fang, Q.Z.: A coordination mechanism for a scheduling game with parallel-batching machines. J. Comb. Optim. 33(2), 1\u201313 (2016)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"1285_CR5","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1016\/j.ejor.2017.05.021","volume":"263","author":"Q Chen","year":"2017","unstructured":"Chen, Q., Lin, L., Tan, Z., Yan, Y.: Coordination mechanisms for scheduling games with proportional deterioration. Eur. J. Oper. Res. 263(2), 380\u2013389 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1285_CR6","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.ejor.2012.02.001","volume":"220","author":"K Lee","year":"2012","unstructured":"Lee, K., Leung, Y.T., Pinedo, M.L.: Coordination mechanisms for parallel machine scheduling. Eur. J. Oper. Res. 220(2), 305\u2013313 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1285_CR7","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1287\/opre.1120.1051","volume":"60","author":"M Feldman","year":"2012","unstructured":"Feldman, M., Tamir, T.: Conflicting congestion effects in resource allocation games. Oper. Res. 60(3), 529\u2013540 (2012)","journal-title":"Oper. Res."},{"issue":"3","key":"1285_CR8","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/s00453-012-9650-6","volume":"66","author":"I Caragiannis","year":"2013","unstructured":"Caragiannis, I.: Efficient coordination mechanisms for unrelated machine scheduling. Algorithmica 66(3), 512\u2013540 (2013)","journal-title":"Algorithmica"},{"issue":"P2","key":"1285_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.tcs.2015.05.035","volume":"607","author":"L Lin","year":"2015","unstructured":"Lin, L., Xian, X., Yan, Y., He, X., Tan, Z.: Inefficiency of equilibria for scheduling game with machine activation costs. Theor. Comput. Sci. 607(P2), 193\u2013207 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"1285_CR10","doi-asserted-by":"publisher","first-page":"938","DOI":"10.1007\/s10878-015-9854-1","volume":"30","author":"L Liu","year":"2015","unstructured":"Liu, L., Tang, G., Fan, B., Wang, X.: Two-person cooperative games on scheduling problems in outpatient pharmacy dispensing process. J. Comb. Optim. 30(4), 938\u2013948 (2015)","journal-title":"J. Comb. Optim."},{"key":"1285_CR11","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2015.02.023","volume":"580","author":"F Xie","year":"2015","unstructured":"Xie, F., Xu, Z., Zhang, Y., Bai, Q.: Scheduling games on uniform machines with activation cost. Theor. Comput. Sci. 580, 28\u201335 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"1285_CR12","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.ipl.2015.10.006","volume":"116","author":"F Xie","year":"2016","unstructured":"Xie, F., Zhang, Y., Bai, Q., Xu, Z.: Inefficiency analysis of the scheduling game on limited identical machines with activation costs. Inf. Process. Lett. 116(4), 316\u2013320 (2016)","journal-title":"Inf. Process. Lett."},{"issue":"17","key":"1285_CR13","doi-asserted-by":"publisher","first-page":"1589","DOI":"10.1016\/j.tcs.2008.12.032","volume":"410","author":"N Immorlica","year":"2009","unstructured":"Immorlica, N., Li, L., Mirrokni, V.S., Schulz, A.: Coordination mechanisms for selfish scheduling. Theor. Comput. Sci. 410(17), 1589\u20131598 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"1285_CR14","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1137\/0209007","volume":"9","author":"Y Cho","year":"1980","unstructured":"Cho, Y., Sahni, S.: Bounds for list schedules on uniform processors. SIAM J. Comput. 9(1), 91\u2013103 (1980)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"1285_CR15","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., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM 44(3), 486\u2013504 (1997)","journal-title":"J. ACM"},{"key":"1285_CR16","volume-title":"Theory of Scheduling","author":"RW Conway","year":"1967","unstructured":"Conway, R.W., Maxwell, W.L., Miller, L.W.: Theory of Scheduling. Addison-Wesley Publishing Company, Boston (1967)"},{"key":"1285_CR17","doi-asserted-by":"crossref","unstructured":"Hoeksma, R., Uetz, M.: The price of anarchy for minsum related machine scheduling. In: WAOA\u201911 Proceedings of the 9th International Conference on Approximation and Online Algorithms, vol. 9, pp. 261\u2013273. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-29116-6_22"},{"key":"1285_CR18","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1017\/CBO9780511800481.022","volume":"20","author":"B V\u00f6cking","year":"2007","unstructured":"V\u00f6cking, B.: Selfish load balancing. Algorithmic Game Theory 20, 517\u2013542 (2007)","journal-title":"Algorithmic Game Theory"},{"issue":"4","key":"1285_CR19","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/j.jda.2005.06.009","volume":"4","author":"P Berenbrink","year":"2006","unstructured":"Berenbrink, P., Goldberg, L.A., Goldberg, P.W., Martin, R.: Utilitarian resource assignment. J. Discrete Algorithms 4(4), 567\u2013587 (2006)","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"1285_CR20","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10951-011-0247-8","volume":"15","author":"B Chen","year":"2012","unstructured":"Chen, B., G\u00fcrel, S.: Efficiency analysis of load balancing games with and without activation costs. J. Sched. 15(2), 157\u2013164 (2012)","journal-title":"J. Sched."},{"issue":"2","key":"1285_CR21","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1145\/321941.321951","volume":"23","author":"E Horowitz","year":"1976","unstructured":"Horowitz, E., Sahni, S.: Exact and approximate algorithms for scheduling nonidentical processors. J. ACM 23(2), 317\u2013327 (1976)","journal-title":"J. ACM"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1285-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-018-1285-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1285-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T19:07:39Z","timestamp":1560625659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-018-1285-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,16]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["1285"],"URL":"https:\/\/doi.org\/10.1007\/s11590-018-1285-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2018,6,16]]},"assertion":[{"value":"4 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}