{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T04:37:16Z","timestamp":1771389436843,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T00:00:00Z","timestamp":1589673600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T00:00:00Z","timestamp":1589673600000},"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","award":["11771013"],"award-info":[{"award-number":["11771013"]}],"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":"publisher","award":["11531011"],"award-info":[{"award-number":["11531011"]}],"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":"publisher","award":["61751303"],"award-info":[{"award-number":["61751303"]}],"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":"publisher","award":["11671135"],"award-info":[{"award-number":["11671135"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Zhejiang Provincial Natural Science Foundation of China","award":["LD19A010001"],"award-info":[{"award-number":["LD19A010001"]}]},{"name":"Zhejiang Provincial Natural Science Foundation of China","award":["LY19A010013"],"award-info":[{"award-number":["LY19A010013"]}]},{"DOI":"10.13039\/100007219","name":"Natural Science Foundation of Shanghai","doi-asserted-by":"publisher","award":["19ZR1411800"],"award-info":[{"award-number":["19ZR1411800"]}],"id":[{"id":"10.13039\/100007219","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-00581-5","type":"journal-article","created":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T12:19:19Z","timestamp":1589717959000},"page":"2104-2122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["The price of fairness for a two-agent scheduling game minimizing total completion time"],"prefix":"10.1007","volume":"44","author":[{"given":"Yubai","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4191-7598","authenticated-orcid":false,"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Zhaohui","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,17]]},"reference":[{"key":"581_CR1","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"52","author":"A Agnetis","year":"2004","unstructured":"Agnetis A, Mirchandani P, Pacciarelli D, Pacifici A (2004) Scheduling problems with two competing agents. Oper Res 52:229\u2013242","journal-title":"Oper Res"},{"key":"581_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41880-8","volume-title":"Multiagent scheduling models and algorithms","author":"A Agnetis","year":"2014","unstructured":"Agnetis A, Billaut JC, Gawiejnowicz S, Pacciarelli D, Soukhal A (2014) Multiagent scheduling models and algorithms. Springer, Berlin"},{"issue":"3","key":"581_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10951-014-0414-9","volume":"18","author":"A Agnetis","year":"2015","unstructured":"Agnetis A, Nicosia J, Pacifici A, Pferschy U (2015) Scheduling two agent task chains with a central selection mechanism. J Sched 18(3):243\u2013261","journal-title":"J Sched"},{"key":"581_CR4","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.ejor.2018.12.048","volume":"276","author":"A Agnetis","year":"2019","unstructured":"Agnetis A, Chen B, Nicosia G, Pacifici A (2019) Price of fairness in two-agent single-machine scheduling problems. Eur J Oper Res 276:79\u201387","journal-title":"Eur J Oper Res"},{"key":"581_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"K Baker","year":"2003","unstructured":"Baker K, Smith JC (2003) A multiple criterion model for machine scheduling. J Sched 6:7\u201316","journal-title":"J Sched"},{"issue":"1","key":"581_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/opre.1100.0865","volume":"59","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas D, Farias V, Trichakis N (2011) The price of fairness. Oper Res 59(1):17\u201331","journal-title":"Oper Res"},{"key":"581_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511598975","volume-title":"Fair division: from cake-cutting to dispute resolution","author":"SJ Brams","year":"1996","unstructured":"Brams SJ, Taylor AD (1996) Fair division: from cake-cutting to dispute resolution. Cambridge University Press, Cambridge"},{"issue":"4","key":"581_CR8","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00224-011-9359-y","volume":"50","author":"I Caragiannis","year":"2012","unstructured":"Caragiannis I, Kaklamanis C, Kanellopoulos P, Kyropoulou M (2012) The efficiency of fair division. Theory Comput Syst 50(4):589\u2013610","journal-title":"Theory Comput Syst"},{"issue":"2","key":"581_CR9","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0165-1765(88)90022-5","volume":"26","author":"Y Chun","year":"1988","unstructured":"Chun Y (1988) The equal-loss principle for barganing problems. Econ Lett 26(2):103\u2013106","journal-title":"Econ Lett"},{"issue":"3","key":"581_CR10","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1006\/game.1994.1021","volume":"6","author":"R Forsythe","year":"1994","unstructured":"Forsythe R, Horowitz JL, Savin NE, Sefton M (1994) Fairness in simple barganing experiments. Games Econ Behav 6(3):347\u2013369","journal-title":"Games Econ Behav"},{"key":"581_CR11","unstructured":"Ghodsi A, Zaharia M, Hindman B, Konwinski A, Shenker S, Stoica I (2011) Dominance resource fairness: fair allocation of multiple resource types. In: Preceedings of 8th USENIX conference on networked systems design and implementation (NSDI), pp 24\u201337"},{"key":"581_CR12","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1080\/07408178608975351","volume":"18","author":"NG Hall","year":"1986","unstructured":"Hall NG (1986) Scheduling problems with generalized due dates. IIE Trans 18:220\u2013222","journal-title":"IIE Trans"},{"key":"581_CR13","unstructured":"John PD., Ariel DP, Tuomas S (2014) Price of fairness in kidney exchange. In: International conference on autonomous agents and multi-agent systems, pp 1013\u20131020"},{"key":"581_CR14","doi-asserted-by":"publisher","first-page":"513","DOI":"10.2307\/1914280","volume":"43","author":"E Kalai","year":"1975","unstructured":"Kalai E, Smorodinsky M (1975) Other solutions to Nash bargaining problem. Econometrica 43:513\u2013518","journal-title":"Econometrica"},{"key":"581_CR15","doi-asserted-by":"crossref","unstructured":"Kurz S (2014) The price of fairness for a small number of indivisible items. In: Operation research proceedings, pp 335\u2013340","DOI":"10.1007\/978-3-319-28697-6_47"},{"key":"581_CR16","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.cie.2009.04.014","volume":"58","author":"Y Ma","year":"2010","unstructured":"Ma Y, Chu CB, Zuo CR (2010) A survey of scheduling with deterministic machine availability constraints. Comput Ind Eng 58:199\u2013211","journal-title":"Comput Ind Eng"},{"key":"581_CR17","unstructured":"Michael P, Khosrow H (1991) Scheduling: theory, algorithms, and systems development, operation research proceedings, volume"},{"key":"581_CR18","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1016\/j.ejor.2016.08.013","volume":"257","author":"G Nicosia","year":"2017","unstructured":"Nicosia G, Pacifici A, Pferschy U (2017) Price of fairness for allocating a bounded resource. Eur J Oper Res 257:933\u2013943","journal-title":"Eur J Oper Res"},{"key":"581_CR19","doi-asserted-by":"crossref","unstructured":"Parkes DC, Procaccia AD, Shah N (2015) Beyond dominant resource fairness: extensions, limitations, and indivisibilities. In: ACM Trans Econ Comput 3(1), Article No.3","DOI":"10.1145\/2739040"},{"key":"581_CR20","doi-asserted-by":"crossref","unstructured":"Pinedo M, Hadavi K (1992) Scheduling: theory, algorithms and systems development. In: Gaul W, Bachem A, Habenicht W, Runge W, Stahl WW (eds) Operations research proceedings 1991, vol 1991. Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-642-46773-8_5"},{"key":"581_CR21","doi-asserted-by":"crossref","unstructured":"Wellman MP, Walsh WE, Wurman PR, Mackie-Mason JK (2001) Auction protocols for decentralized scheduling. Game Econ Behav 35:271\u2013303","DOI":"10.1006\/game.2000.0822"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00581-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00581-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00581-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T08:48:49Z","timestamp":1664354929000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00581-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,17]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["581"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00581-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,17]]},"assertion":[{"value":"17 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}