{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:26:26Z","timestamp":1762521986710,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,2,7]],"date-time":"2017-02-07T00:00:00Z","timestamp":1486425600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Austrian Science Fund (AT)","award":["P 23829-N13"],"award-info":[{"award-number":["P 23829-N13"]}]},{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["2012C4E3KT 001"],"award-info":[{"award-number":["2012C4E3KT 001"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s10288-017-0341-7","type":"journal-article","created":{"date-parts":[[2017,2,7]],"date-time":"2017-02-07T06:27:44Z","timestamp":1486448864000},"page":"15-29","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Competitive multi-agent scheduling with an iterative selection rule"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4043-2812","authenticated-orcid":false,"given":"Gaia","family":"Nicosia","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6144-0024","authenticated-orcid":false,"given":"Andrea","family":"Pacifici","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8881-1497","authenticated-orcid":false,"given":"Ulrich","family":"Pferschy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,7]]},"reference":[{"issue":"2","key":"341_CR1","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"52","author":"A Agnetis","year":"2004","unstructured":"Agnetis A, Mirchandani PB, Pacciarelli D, Pacifici A (2004) Scheduling problems with two competing agents. Oper Res 52(2):229\u2013242","journal-title":"Oper Res"},{"key":"341_CR2","doi-asserted-by":"crossref","unstructured":"Agnetis A, Nicosia G, Pacifici A, Pferschy U (2013) Two agents competing for a shared machine. In: Proceedings of the 3rd international conference on algorithmic decision theory (ADT 2013), LNCS, vol 8176. Springer, pp 1\u201314","DOI":"10.1007\/978-3-642-41575-3_1"},{"key":"341_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-41880-8","volume-title":"Multiagent scheduling: models and algorithms","author":"A Agnetis","year":"2014","unstructured":"Agnetis A, Billaut J-C, Gawiejnowicz S, Pacciarelli D, Soukhal A (2014) Multiagent scheduling: models and algorithms. Springer, Berlin"},{"issue":"3","key":"341_CR4","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10951-014-0414-9","volume":"18","author":"A Agnetis","year":"2015","unstructured":"Agnetis A, Nicosia G, 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":"341_CR5","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.tcs.2006.07.057","volume":"369","author":"E Angel","year":"2006","unstructured":"Angel E, Bampis E, Pascual F (2006) Truthful algorithms for scheduling selfish tasks on parallel machines. Theor Comput Sci 369:157\u2013168","journal-title":"Theor Comput Sci"},{"issue":"1","key":"341_CR6","doi-asserted-by":"crossref","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(1):7\u201316","journal-title":"J Sched"},{"issue":"17","key":"341_CR7","doi-asserted-by":"crossref","first-page":"2220","DOI":"10.1002\/cpe.1752","volume":"23","author":"J Cohen","year":"2011","unstructured":"Cohen J, Cordeiro D, Trystram D, Wagner F (2011) Multi-organization scheduling approximation algorithms. Concurr Comput Pract Exp 23(17):2220\u20132234","journal-title":"Concurr Comput Pract Exp"},{"issue":"1","key":"341_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.dam.2015.08.003","volume":"217","author":"A Darmann","year":"2016","unstructured":"Darmann A, Pferschy U, Schauer J (2016) On the shortest path game. Discrete Appl Math 217(1):3\u201318. doi:\n                        10.1016\/j.dam.2015.08.003","journal-title":"Discrete Appl Math"},{"issue":"3","key":"341_CR9","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s10951-011-0252-y","volume":"15","author":"N Huynh Tuong","year":"2012","unstructured":"Huynh Tuong N, Soukhal A, Billaut J-C (2012) Single-machine multi-agent scheduling problems with a global objective function. J Sched 15(3):311\u2013321","journal-title":"J Sched"},{"issue":"17","key":"341_CR10","doi-asserted-by":"crossref","first-page":"1589","DOI":"10.1016\/j.tcs.2008.12.032","volume":"410","author":"N Immorlica","year":"2009","unstructured":"Immorlica N, Li L, Mirrokni V, Schulz A (2009) Coordination mechanisms for selfish scheduling. Theor Comput Sci 410(17):1589\u20131598","journal-title":"Theor Comput Sci"},{"issue":"2","key":"341_CR11","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1287\/opre.1090.0744","volume":"58","author":"YT Leung","year":"2010","unstructured":"Leung YT, Pinedo M, Wan G (2010) Competitive two-agent scheduling and its applications. Oper Res 58(2):458\u2013469","journal-title":"Oper Res"},{"issue":"1","key":"341_CR12","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10479-011-1057-2","volume":"207","author":"C Marini","year":"2013","unstructured":"Marini C, Nicosia G, Pacifici A, Pferschy U (2013) Strategies in competing subset selection. Ann Oper Res 207(1):181\u2013200","journal-title":"Ann Oper Res"},{"issue":"16","key":"341_CR13","doi-asserted-by":"crossref","first-page":"1865","DOI":"10.1016\/j.dam.2010.11.011","volume":"159","author":"G Nicosia","year":"2011","unstructured":"Nicosia G, Pacifici A, Pferschy U (2011) Competitive subset selection with two agents. Discrete Appl Math 159(16):1865\u20131877","journal-title":"Discrete Appl Math"},{"key":"341_CR14","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.tcs.2015.06.051","volume":"596","author":"G Nicosia","year":"2015","unstructured":"Nicosia G, Pacifici A, Pferschy U (2015) Two agent scheduling with a central selection mechanism. Theor Comput Sci 596:109\u2013123","journal-title":"Theor Comput Sci"},{"key":"341_CR15","unstructured":"Nisan N, Ronen A (1999) Algorithmic mechanism design. In: Proceedings of the 31st annual ACM symposium on theory of computing, STOC 1999, pp 129\u2013140"},{"key":"341_CR16","volume-title":"An introduction to game theory","author":"MJ Osborne","year":"2004","unstructured":"Osborne MJ (2004) An introduction to game theory. Oxford University Press, Oxford"},{"issue":"1","key":"341_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2013.09.017","volume":"235","author":"P Perez-Gonzalez","year":"2014","unstructured":"Perez-Gonzalez P, Framinan JM (2014) A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems. Eur J Oper Res 235(1):1\u201316","journal-title":"Eur J Oper Res"},{"key":"341_CR18","volume-title":"Multicriteria scheduling. Theory, models and algorithms","author":"V T\u2019Kindt","year":"2006","unstructured":"T\u2019Kindt V, Billaut J-C (2006) Multicriteria scheduling. Theory, models and algorithms. Springer, Berlin"},{"key":"341_CR19","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.tcs.2012.11.002","volume":"468","author":"K Zhao","year":"2013","unstructured":"Zhao K, Lu X (2013) Approximation schemes for two-agent scheduling on parallel machines. Theor Comput Sci 468:114\u2013121","journal-title":"Theor Comput Sci"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-017-0341-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-017-0341-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-017-0341-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,3]],"date-time":"2018-03-03T01:53:49Z","timestamp":1520042029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-017-0341-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,7]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["341"],"URL":"https:\/\/doi.org\/10.1007\/s10288-017-0341-7","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2017,2,7]]}}}