{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T00:44:21Z","timestamp":1792111461890,"version":"4.4.0"},"publisher-location":"New York, NY","reference-count":5,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_46","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T16:09:45Z","timestamp":1553098185000},"page":"181-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Best Response Algorithms for Selfish Routing"],"prefix":"10.1007","author":[{"given":"Paul","family":"Spirakis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"46_CR246","doi-asserted-by":"crossref","unstructured":"Awerbuch B, Azar Y, Epstein A (2005) The price of routing unsplittable flows. In: Proceedings of the ACM symposium on theory of computing (STOC) 2005. ACM, New York, pp 57\u201366","DOI":"10.1145\/1060590.1060599"},{"key":"46_CR247","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"RJ Duffin","year":"1965","unstructured":"Duffin RJ (1965) Topology of series-parallel networks. J Math Anal Appl 10:303\u2013318","journal-title":"J Math Anal Appl"},{"key":"46_CR248","doi-asserted-by":"crossref","unstructured":"Fotakis D, Kontogiannis S, Spirakis P (2006) Symmetry in network congestion games: pure equilibria and anarchy cost. In: Proceedings of the 3rd workshop of approximate and on-line algorithms (WAOA 2005). Lecture notes in computer science (LNCS), vol 3879. Springer, Berlin\/Heidelberg, pp 161\u2013175","DOI":"10.1007\/11671411_13"},{"key":"46_CR249","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.tcs.2005.09.024","volume":"348","author":"D Fotakis","year":"2005","unstructured":"Fotakis D, Kontogiannis S, Spirakis P (2005) Selfish unsplittable flows. J Theor Comput Sci 348:226\u2013239","journal-title":"J Theor Comput Sci"},{"issue":"4","key":"46_CR250","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1023\/A:1016770831869","volume":"17","author":"L Libman","year":"2001","unstructured":"Libman L, Orda A (2001) Atomic resource sharing in noncooperative networks. Telecommun Syst 17(4):385\u2013409","journal-title":"Telecommun Syst"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:49:33Z","timestamp":1792108173000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_46","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}