{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T16:31:50Z","timestamp":1754152310241,"version":"3.41.2"},"reference-count":18,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12001313"],"award-info":[{"award-number":["12001313"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2025,8]]},"abstract":"<jats:p> We consider the scheduling game with activation cost, where jobs as selfish agents compete for processing on serial-batching identical machines. Each job selects a machine (more precisely, a batch on a machine) for processing to minimize his disutility composed of the load of his machine and the fraction of activation cost. We claim that such a game may not admit any Nash equilibrium under the uniform sharing rule. We present an algorithm and prove that the schedule produced by the algorithm is a tight approximate Nash equilibria. <\/jats:p>","DOI":"10.1142\/s0129054122460078","type":"journal-article","created":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T02:55:25Z","timestamp":1674096925000},"page":"697-708","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Nash Equilibria for Scheduling Game on Serial-Batching-Machines with Activation Cost"],"prefix":"10.1142","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0506-1710","authenticated-orcid":false,"given":"Long","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Management, Institute of Operations Research, Qufu Normal University, Rizhao, Shandong 276826, P. R. China"},{"name":"School of Computer Science and Technology, Qilu University of Technology (Shandong Academy of Sciences), Jinan, Shandong 250353, P. R. China"}]},{"given":"Jiguo","family":"Yu","sequence":"additional","affiliation":[{"name":"Big Data Institute, Qilu University of Technology, Jinan, Shandong 250353, P. R. China"}]},{"given":"Yuzhong","family":"Zhang","sequence":"additional","affiliation":[{"name":"Institute of Operations Research, Qufu Normal University, Rizhao, Shandong 276826, P. R. China"}]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[{"name":"Faculty of Business Administration, University of New Brunswick, Fredericton, NB E3B 5A3, Canada"}]}],"member":"219","published-online":{"date-parts":[[2023,1,19]]},"reference":[{"key":"S0129054122460078BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.07.012"},{"key":"S0129054122460078BIB002","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1363"},{"key":"S0129054122460078BIB003","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.50"},{"key":"S0129054122460078BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-011-0247-8"},{"key":"S0129054122460078BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.07.024"},{"key":"S0129054122460078BIB006","first-page":"1511","volume-title":"Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems (AAMAS)","author":"Czumaj A.","year":"2017"},{"key":"S0129054122460078BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2014.02.002"},{"key":"S0129054122460078BIB008","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595918500331"},{"key":"S0129054122460078BIB009","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1120.1051"},{"key":"S0129054122460078BIB010","doi-asserted-by":"publisher","DOI":"10.3390\/a14040103"},{"key":"S0129054122460078BIB011","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1120.0543"},{"key":"S0129054122460078BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.02.001"},{"key":"S0129054122460078BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.05.035"},{"key":"S0129054122460078BIB014","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-016-0134-2"},{"issue":"2","key":"S0129054122460078BIB015","first-page":"1","volume":"33","author":"Nong Q. Q.","year":"2016","journal-title":"J. Comb. Optim."},{"key":"S0129054122460078BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.02.023"},{"issue":"1","key":"S0129054122460078BIB017","first-page":"87","volume":"22","author":"Zhang L.","year":"2018","journal-title":"Oper. Res. T."},{"key":"S0129054122460078BIB018","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595921400078"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054122460078","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,22]],"date-time":"2025-07-22T03:44:14Z","timestamp":1753155854000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129054122460078"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,19]]},"references-count":18,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["10.1142\/S0129054122460078"],"URL":"https:\/\/doi.org\/10.1142\/s0129054122460078","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2023,1,19]]}}}