{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:04:25Z","timestamp":1755219865923,"version":"3.43.0"},"publisher-location":"Singapore","reference-count":14,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819610891"},{"type":"electronic","value":"9789819610907"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-1090-7_28","type":"book-chapter","created":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T16:33:21Z","timestamp":1741106001000},"page":"348-358","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Nash Equilibrium and\u00a0Price of\u00a0Anarchy for\u00a0Scheduling Games Based on\u00a0a\u00a0Mixed Coordination Mechanism"],"prefix":"10.1007","author":[{"given":"Zhiwen","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-5068-3608","authenticated-orcid":false,"given":"Long","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingwen","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Sheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuzhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,5]]},"reference":[{"issue":"1","key":"28_CR1","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1111\/itor.12558","volume":"28","author":"QQ Chen","year":"2018","unstructured":"Chen, Q.Q., Tan, Z.Y.: Mixed coordination mechanisms for scheduling games on hierarchical machines. Int. Trans. Oper. Res. 28(1), 419\u2013437 (2018). https:\/\/doi.org\/10.1111\/itor.12558","journal-title":"Int. Trans. Oper. Res."},{"issue":"1","key":"28_CR2","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). https:\/\/doi.org\/10.1137\/0209007","journal-title":"SIAM J. Comput."},{"key":"28_CR3","doi-asserted-by":"publisher","unstructured":"Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination mechanisms. In: 31st International Colloquium on Automata, Languages and Programming, pp. 345\u2013357. Springer Berlin Heidelberg, Turku, Finland (2004). https:\/\/doi.org\/10.1007\/978-3-540-27836-8_31","DOI":"10.1007\/978-3-540-27836-8_31"},{"issue":"36","key":"28_CR4","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. Theoret. Comput. Sci. 410(36), 3327\u20133336 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.01.005","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR5","doi-asserted-by":"publisher","unstructured":"Cole, R., Correa, J. R., Gkatzelis, V., Mirrokni, V., Olver, N.: Inner product spaces for minsum coordination mechanisms. In: 43rd Annual ACM Symposium on Theory of Computing, pp. 539\u2013548. Association for Computing Machinery, New York (2011). https:\/\/doi.org\/10.1145\/1993636.1993708","DOI":"10.1145\/1993636.1993708"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1137\/0206013","volume":"6","author":"T Gonzalez","year":"1977","unstructured":"Gonzalez, T., Ibarra, O.H., Sahni, S.: Bounds for LPT schedules on uniform processors. SIAM J. Comput. 6, 155\u2013166 (1977). https:\/\/doi.org\/10.1137\/0206013","journal-title":"SIAM J. Comput."},{"key":"28_CR7","doi-asserted-by":"publisher","unstructured":"Graham, R.L., Lawler, E.L., Lenstra J.K., Rinnooy Kan A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5, 287\u2013326 (1979). https:\/\/doi.org\/10.1016\/S0167-5060(08)70356-X","DOI":"10.1016\/S0167-5060(08)70356-X"},{"issue":"17","key":"28_CR8","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.E., Mirrokni, V.S., Schulz, A.S.: Coordination mechanisms for selfish scheduling. Theoret. Comput. Sci. 410(17), 1589\u20131598 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2008.12.032","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR9","doi-asserted-by":"publisher","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Annual symposium on theoretical aspects of computer science, pp. 404\u2013413. Springer Berlin Heidelberg, Berlin (1999). https:\/\/doi.org\/10.1007\/3-540-49116-3_38","DOI":"10.1007\/3-540-49116-3_38"},{"key":"28_CR10","doi-asserted-by":"publisher","unstructured":"Kov\u00e1cs. A.: New approximation bounds for LPT scheduling. Algorithmica 57(2): 413\u2013433 (2010). https:\/\/doi.org\/10.1007\/s00453-008-9224-9","DOI":"10.1007\/s00453-008-9224-9"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/j.disopt.2011.05.001","volume":"8","author":"K Lee","year":"2011","unstructured":"Lee, K., Leung, J.Y.T., Pinedo, M.L.: Coordination mechanisms with hybrid local policies. Discret. Optim. 8, 513\u2013524 (2011). https:\/\/doi.org\/10.1016\/j.disopt.2011.05.001","journal-title":"Discret. Optim."},{"issue":"2","key":"28_CR12","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, J.Y.T., Pinedo, M.L.: Coordination mechanisms for parallel machine scheduling. Eur. J. Oper. Res. 220(2), 305\u2013313 (2012). https:\/\/doi.org\/10.1016\/j.ejor.2012.02.001","journal-title":"Eur. J. Oper. Res."},{"key":"28_CR13","doi-asserted-by":"publisher","unstructured":"Papadimitriou, C.: Algorithms, games, and the Internet. In: 33rd Annual ACM Symposium on Theory of Computing, pp.749\u2013753. Hersonissos, Greece, (2001). https:\/\/doi.org\/10.1145\/380752.380883","DOI":"10.1145\/380752.380883"},{"issue":"4","key":"28_CR14","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1007\/s11590-018-1285-3","volume":"13","author":"L Zhang","year":"2018","unstructured":"Zhang, L., Zhang, Y., Du, D., Bai, Q.: Improved price of anarchy for machine scheduling games with coordination mechanisms. Optimization Letters 13(4), 949\u2013959 (2018). https:\/\/doi.org\/10.1007\/s11590-018-1285-3","journal-title":"Optimization Letters"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1090-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T11:50:37Z","timestamp":1754567437000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1090-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610891","9789819610907"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1090-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}