{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:12Z","timestamp":1759638372229,"version":"3.41.2"},"reference-count":20,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Asia Pac. J. Oper. Res."],"published-print":{"date-parts":[[2021,10]]},"abstract":"<jats:p> We study one scheduling game with activation cost, where each game involves [Formula: see text] jobs being processed on [Formula: see text] parallel-batching identical machines. Each job, as an agent, selects a machine (more precisely, a batch on a machine) for processing to minimize his disutility, which consists of the load of his machine and his share in the machine\u2019s activation cost. We prove that Nash equilibrium may not exist for the scheduling game. We design a polynomial-time algorithm to produce pareto-optimal schedules for two special cases of the scheduling game. Finally, we show that the general form of the scheduling game has pareto-optimal schedule by an improved polynomial-time algorithm, and prove that the schedule is a tight [Formula: see text]-approximate Nash equilibria. <\/jats:p>","DOI":"10.1142\/s0217595921400078","type":"journal-article","created":{"date-parts":[[2021,2,4]],"date-time":"2021-02-04T01:30:43Z","timestamp":1612402243000},"source":"Crossref","is-referenced-by-count":4,"title":["Pareto-optimal Algorithms for Scheduling Games on Parallel-batching Machines with Activation Cost"],"prefix":"10.1142","volume":"38","author":[{"given":"Long","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Qilu University of Technology (Shandong Academy of Sciences), Ji\u2019nan, Shandong 250014, P. R. China"},{"name":"School of Management, Qufu Normal University, Rizhao, Shandong 276826, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiguo","family":"Yu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Qilu University of Technology (Shandong Academy of Sciences), Ji\u2019nan, Shandong 250014, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuzhong","family":"Zhang","sequence":"additional","affiliation":[{"name":"Institute of Operations Research, Qufu Normal University, Rizhao, Shandong 276826, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2021,3,13]]},"reference":[{"key":"S0217595921400078BIB001","first-page":"177","volume-title":"International Conference on Computational Intelligence","author":"Antonio G","year":"1999"},{"doi-asserted-by":"publisher","key":"S0217595921400078BIB002","DOI":"10.1287\/opre.2015.1363"},{"doi-asserted-by":"publisher","key":"S0217595921400078BIB003","DOI":"10.1109\/FOCS.2011.50"},{"doi-asserted-by":"publisher","key":"S0217595921400078BIB004","DOI":"10.1007\/s10951-011-0247-8"},{"doi-asserted-by":"publisher","key":"S0217595921400078BIB005","DOI":"10.1007\/s10951-013-0318-0"},{"doi-asserted-by":"publisher","key":"S0217595921400078BIB006","DOI":"10.1137\/070699652"},{"key":"S0217595921400078BIB007","first-page":"1511","volume-title":"Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems","author":"Czumaj A","year":"2017"},{"doi-asserted-by":"publisher","key":"S0217595921400078BIB008","DOI":"10.1016\/j.jet.2014.02.002"},{"doi-asserted-by":"publisher","key":"S0217595921400078BIB009","DOI":"10.1142\/S0217595918500331"},{"doi-asserted-by":"publisher","key":"S0217595921400078BIB010","DOI":"10.1287\/opre.1120.1051"},{"doi-asserted-by":"publisher","key":"S0217595921400078BIB011","DOI":"10.1287\/moor.1120.0543"},{"doi-asserted-by":"publisher","key":"S0217595921400078BIB012","DOI":"10.1016\/S0378-4754(02)00019-8"},{"doi-asserted-by":"publisher","key":"S0217595921400078BIB013","DOI":"10.1016\/j.ejor.2012.02.001"},{"doi-asserted-by":"publisher","key":"S0217595921400078BIB014","DOI":"10.1007\/s40305-016-0134-2"},{"key":"S0217595921400078BIB015","first-page":"1","volume":"33","author":"Nong QQ","year":"2016","journal-title":"Journal of Combinatorial Optimization"},{"doi-asserted-by":"publisher","key":"S0217595921400078BIB016","DOI":"10.1257\/jel.37.3.1067"},{"doi-asserted-by":"publisher","key":"S0217595921400078BIB017","DOI":"10.1016\/j.tcs.2015.02.023"},{"key":"S0217595921400078BIB018","first-page":"87","volume":"22","author":"Zhang L","year":"2018","journal-title":"Operations Research Transactions"},{"doi-asserted-by":"publisher","key":"S0217595921400078BIB019","DOI":"10.1007\/s11590-018-1285-3"},{"doi-asserted-by":"publisher","key":"S0217595921400078BIB020","DOI":"10.1007\/s10951-013-0311-7"}],"container-title":["Asia-Pacific Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0217595921400078","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T09:03:31Z","timestamp":1633943011000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0217595921400078"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,13]]},"references-count":20,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["10.1142\/S0217595921400078"],"URL":"https:\/\/doi.org\/10.1142\/s0217595921400078","relation":{},"ISSN":["0217-5959","1793-7019"],"issn-type":[{"type":"print","value":"0217-5959"},{"type":"electronic","value":"1793-7019"}],"subject":[],"published":{"date-parts":[[2021,3,13]]},"article-number":"2140007"}}