{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T00:44:31Z","timestamp":1792111471775,"version":"4.4.0"},"publisher-location":"New York, NY","reference-count":6,"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_360","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:03:20Z","timestamp":1461269000000},"page":"1930-1932","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Selfish Unsplittable Flows: Algorithms for Pure Equilibria"],"prefix":"10.1007","author":[{"given":"Paul Pavlos","family":"Spirakis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"360_CR19112","doi-asserted-by":"crossref","unstructured":"Fabrikant A, Papadimitriou C, Talwar K (2004) The complexity of pure nash equilibria. In: Proceedings of the 36th ACM symposium on theory of computing (STOC\u201904). ACM, Chicago","DOI":"10.1145\/1007352.1007445"},{"key":"360_CR19113","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 Theory Comput Sci 348:226\u2013239","journal-title":"J Theory Comput Sci"},{"issue":"4","key":"360_CR19114","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"},{"key":"360_CR19115","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer D, Shapley L (1996) Potential games. Game Econ Behav 14:124\u2013143","journal-title":"Game Econ Behav"},{"key":"360_CR19116","first-page":"2.7","volume":"11","author":"P Panagopoulou","year":"2006","unstructured":"Panagopoulou P, Spirakis P (2006) Algorithms for pure nash equilibrium in weighted congestion games. ACM J Exp Algorithms 11:2.7","journal-title":"ACM J Exp Algorithms"},{"key":"360_CR19117","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal RW (1973) A class of games possessing pure-strategy nash equilibria. Int J Game Theory 2:65\u201367","journal-title":"Int J Game Theory"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_360","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:52:54Z","timestamp":1792108374000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_360"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_360","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"}}]}}