{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:15Z","timestamp":1740122415607,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T00:00:00Z","timestamp":1692576000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T00:00:00Z","timestamp":1692576000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2015\/11937-9","2016\/01860-1","2017\/05223-9"],"award-info":[{"award-number":["2015\/11937-9","2016\/01860-1","2017\/05223-9"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["308689\/2017-8","425340\/2016-3","314366\/2018-0","425806\/2018-9"],"award-info":[{"award-number":["308689\/2017-8","425340\/2016-3","314366\/2018-0","425806\/2018-9"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["311039\/2020-0"],"award-info":[{"award-number":["311039\/2020-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["001"],"award-info":[{"award-number":["001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2019\/14492-9","311039\/2020\u20130","313146\/2022-5"],"award-info":[{"award-number":["2019\/14492-9","311039\/2020\u20130","313146\/2022-5"]}],"id":[{"id":"10.13039\/501100001807","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":[[2023,9]]},"DOI":"10.1007\/s10878-023-01073-y","type":"journal-article","created":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T21:02:14Z","timestamp":1692651734000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tight bounds for the price of anarchy and stability in sequential transportation games"],"prefix":"10.1007","volume":"46","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6219-2392","authenticated-orcid":false,"given":"Francisco J. M. da","family":"Silva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1067-6421","authenticated-orcid":false,"given":"Fl\u00e1vio K.","family":"Miyazawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5801-3774","authenticated-orcid":false,"given":"Ieremies V. F.","family":"Romero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0472-4810","authenticated-orcid":false,"given":"Rafael C. S.","family":"Schouery","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,21]]},"reference":[{"key":"1073_CR1","doi-asserted-by":"publisher","unstructured":"Angelucci A, Bil\u00f2 V, Flammini M, Moscardelli L (2013) On the sequential price of anarchy of isolation games. In: International computing and combinatorics conference, pp 17\u201328 https:\/\/doi.org\/10.1007\/978-3-642-38768-5_4","DOI":"10.1007\/978-3-642-38768-5_4"},{"issue":"4","key":"1073_CR2","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich E, Dasgupta A, Kleinberg J, Tardos E, Wexler T, Roughgarden T (2008) The price of stability for network design with fair cost allocation. SIAM J Comput 38(4):1602\u20131623. https:\/\/doi.org\/10.1137\/070680096","journal-title":"SIAM J Comput"},{"key":"1073_CR3","doi-asserted-by":"publisher","unstructured":"Bil\u00f2 V, Flammini M, Monaco G, Moscardelli L(2012) Some anomalies of farsighted strategic behavior. In: International Workshop on approximation and online algorithms, pp 229\u2013241 . https:\/\/doi.org\/10.1007\/978-3-642-38016-7_19","DOI":"10.1007\/978-3-642-38016-7_19"},{"key":"1073_CR4","doi-asserted-by":"publisher","unstructured":"Cole R, Correa JR, Gkatzelis V, Mirrokni V, Olver N (2011) Inner product spaces for Minsum coordination mechanisms. In: Proceedings of the forty-third annual ACM symposium on theory of computing, pp 539\u2013548 . https:\/\/doi.org\/10.1145\/1993636.1993708","DOI":"10.1145\/1993636.1993708"},{"issue":"4","key":"1073_CR5","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1287\/moor.2018.0968","volume":"44","author":"J Correa","year":"2019","unstructured":"Correa J, de Jong J, De Keijzer B, Uetz M (2019) The inefficiency of nash and subgame perfect equilibria for network routing. Math Oper Res 44(4):1286\u20131303. https:\/\/doi.org\/10.1287\/moor.2018.0968","journal-title":"Math Oper Res"},{"key":"1073_CR6","doi-asserted-by":"publisher","unstructured":"de\u00a0Jong J, Uetz M (2014) The sequential price of anarchy for atomic congestion games. In: International conference on web and internet economics, pp 429\u2013434 https:\/\/doi.org\/10.1007\/978-3-319-13129-0_35","DOI":"10.1007\/978-3-319-13129-0_35"},{"key":"1073_CR7","doi-asserted-by":"publisher","unstructured":"de\u00a0Jong J, Uetz M, Wombacher A (2013) Decentralized throughput scheduling. In: International conference on algorithms and complexity, pp 134\u2013145 . https:\/\/doi.org\/10.1007\/978-3-642-38233-8_12","DOI":"10.1007\/978-3-642-38233-8_12"},{"key":"1073_CR8","doi-asserted-by":"publisher","unstructured":"Fotakis D, Gourv\u00e8s L, Monnot J(2017) Selfish transportation games. In: International conference on current trends in theory and practice of informatics, pp 176\u2013187 . https:\/\/doi.org\/10.1007\/978-3-319-51963-0_14","DOI":"10.1007\/978-3-319-51963-0_14"},{"key":"1073_CR9","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.trb.2013.08.012","volume":"57","author":"M Furuhata","year":"2013","unstructured":"Furuhata M, Dessouky M, Ord\u00f3\u00f1ez F, Brunet ME, Wang X, Koenig S (2013) Ridesharing: the state-of-the-art and future directions. Transp Res Part B: Methodol 57:28\u201346. https:\/\/doi.org\/10.1016\/j.trb.2013.08.012","journal-title":"Transp Res Part B: Methodol"},{"issue":"5","key":"1073_CR10","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/j.orl.2015.08.003","volume":"43","author":"R Hassin","year":"2015","unstructured":"Hassin R, Yovel U (2015) Sequential scheduling on identical machines. Oper Res Lett 43(5):530\u2013533. https:\/\/doi.org\/10.1016\/j.orl.2015.08.003","journal-title":"Oper Res Lett"},{"key":"1073_CR11","doi-asserted-by":"publisher","unstructured":"Hoeksma R, Uetz M (2011) The price of anarchy for minsum related machine scheduling. In: International workshop on approximation and online algorithms, pp 261\u2013273. https:\/\/doi.org\/10.1007\/978-3-642-29116-6_22","DOI":"10.1007\/978-3-642-29116-6_22"},{"issue":"2","key":"1073_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E Koutsoupias","year":"2009","unstructured":"Koutsoupias E, Papadimitriou C (2009) Worst-case equilibria. Comput Sci Rev 3(2):65\u201369. https:\/\/doi.org\/10.1016\/j.cosrev.2009.04.003","journal-title":"Comput Sci Rev"},{"key":"1073_CR13","doi-asserted-by":"publisher","unstructured":"Leme RP, Syrgkanis V, Tardos \u00c9(2012) The curse of simultaneity. In: Proceedings of the 3rd innovations in theoretical computer science conference, pp 60\u201367 . https:\/\/doi.org\/10.1145\/2090236.2090242","DOI":"10.1145\/2090236.2090242"},{"key":"1073_CR14","doi-asserted-by":"publisher","unstructured":"Roughgarden T (2009) Intrinsic robustness of the price of anarchy. In: Proceedings of the forty-first annual ACM symposium on Theory of computing, pp 513\u2013522. https:\/\/doi.org\/10.1145\/1536414.1536485","DOI":"10.1145\/1536414.1536485"},{"key":"1073_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511811654","volume-title":"Multiagent systems: algorithmic, game-theoretic, and logical foundations","author":"Y Shoham","year":"2008","unstructured":"Shoham Y, Leyton-Brown K (2008) Multiagent systems: algorithmic, game-theoretic, and logical foundations. Cambridge University Press, Cambridge"},{"key":"1073_CR16","first-page":"501","volume":"2","author":"E Zermelo","year":"1913","unstructured":"Zermelo E (1913) \u00dcber eine anwendung der mengenlehre auf die theorie des schachspiels. Proc Fifth Int Congr Math 2:501\u2013504","journal-title":"Proc Fifth Int Congr Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01073-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01073-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01073-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T10:16:20Z","timestamp":1695377780000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01073-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,21]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["1073"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01073-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2023,8,21]]},"assertion":[{"value":"25 July 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"10"}}