{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T06:52:42Z","timestamp":1768891962654,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T00:00:00Z","timestamp":1583452800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T00:00:00Z","timestamp":1583452800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10878-020-00556-6","type":"journal-article","created":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T17:02:31Z","timestamp":1583514151000},"page":"1848-1879","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Tighter price of anarchy for selfish task allocation on selfish machines"],"prefix":"10.1007","volume":"44","author":[{"given":"Xiayan","family":"Cheng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2821-891X","authenticated-orcid":false,"given":"Rongheng","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yunxia","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,6]]},"reference":[{"key":"556_CR1","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s00224-006-1316-9","volume":"40","author":"N Andelman","year":"2007","unstructured":"Andelman N, Azar Y, Sorani M (2007) Truthful approximation mechanisms for scheduling selfish related machines. Theory Comput Syst 40:423\u2013436","journal-title":"Theory Comput Syst"},{"issue":"2","key":"556_CR2","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 (2012) Efficiency analysis of load balancing games with and without activation costs. J Sched 15(2):157\u2013164","journal-title":"J Sched"},{"key":"556_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.tcs.2013.02.019","volume":"507","author":"X Chen","year":"2013","unstructured":"Chen X, Hu X, Ma W, Wang C (2013) Reducing price of anarchy of selfish task allocation with more selfishness. Theor Comput Sci 507:17\u201333","journal-title":"Theor Comput Sci"},{"key":"556_CR4","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-540-73545-8_20","volume-title":"Computing and Combinatorics: 13th Annual International Conference, COCOON 2007, LNCS 4598","author":"G Christodoulou","year":"2007","unstructured":"Christodoulou G, Gourv\u00e8s L, Pascual F (2007) Scheduling Selfish Tasks: About the Performance of Truthful Algorithms. Computing and Combinatorics: 13th Annual International Conference, COCOON 2007, LNCS 4598. Springer-Verlag, Berlin, pp 187\u2013197"},{"key":"556_CR5","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/BF01930985","volume":"19","author":"G Finn","year":"1979","unstructured":"Finn G, Horowitz E (1979) A linear time approximation algorithm for multiprocessor scheduling. BIT Numer Math 19:312\u2013320","journal-title":"BIT Numer Math"},{"key":"556_CR6","volume-title":"Computers and intractabilities: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractabilities: a guide to the theory of NP-completeness. W. H. Freeman, New York"},{"key":"556_CR7","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham RL (1969) Bounds on multiprocessing timing anomalies. SIAM J Appl Math 17:416\u2013429","journal-title":"SIAM J Appl Math"},{"issue":"1","key":"556_CR8","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"DS Hochbaum","year":"1987","unstructured":"Hochbaum DS, Shmoys DB (1987) Using dual approximation algorithms for scheduling problems: theoretical and practical results. J ACM 34(1):144\u2013162","journal-title":"J ACM"},{"key":"556_CR9","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s10951-018-0584-y","volume":"22","author":"HC Hung","year":"2019","unstructured":"Hung HC, Lin BMT, Posner ME, Wei J (2019) Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs. J Sched 22:413\u2013431","journal-title":"J Sched"},{"key":"556_CR10","doi-asserted-by":"crossref","unstructured":"Koutsoupias E, Papadimitriou CH (1999) Worst-case equilibria. In: STACS\u201999, LNCS vol 1563, pp 404\u2013413","DOI":"10.1007\/3-540-49116-3_38"},{"issue":"6","key":"556_CR11","first-page":"867","volume":"63","author":"R Li","year":"2014","unstructured":"Li R, Cheng X, Zhou Y (2014) Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines. Optim J Math Program Op Res 63(6):867\u2013882","journal-title":"Optim J Math Program Op Res"},{"issue":"2","key":"556_CR12","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.tcs.2013.11.012","volume":"521","author":"L Lin","year":"2014","unstructured":"Lin L, Tan Z (2014) Inefficiency of Nash equilibrium for scheduling games with constrained jobs: aparametric analysis. Theor Comput Sci 521(2):123\u2013134","journal-title":"Theor Comput Sci"},{"key":"556_CR13","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N Nisan","year":"2001","unstructured":"Nisan N, Ronen A (2001) Algorithmic mechanism design. Games Econ Behav 35:166\u2013196","journal-title":"Games Econ Behav"},{"issue":"2","key":"556_CR14","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1134\/S1995080215020171","volume":"36","author":"ON Shulgina","year":"2015","unstructured":"Shulgina ON, Shcherbakova NK (2015) About one algorithm for solving scheduling problem. Lobachevskii J Math 36(2):211\u2013214","journal-title":"Lobachevskii J Math"},{"issue":"4","key":"556_CR15","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 (2016) Inefficiency analysis of the scheduling game on limited identical machines with activation costs. Inf Process Lett 116(4):316\u2013320","journal-title":"Inf Process Lett"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00556-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00556-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00556-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T08:47:24Z","timestamp":1664354844000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00556-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,6]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["556"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00556-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,6]]},"assertion":[{"value":"6 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}