{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T17:27:19Z","timestamp":1730222839997,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1109\/gamenets.2009.5137397","type":"proceedings-article","created":{"date-parts":[[2009,7,1]],"date-time":"2009-07-01T11:05:14Z","timestamp":1246446314000},"page":"158-163","source":"Crossref","is-referenced-by-count":2,"title":["How to find Nash equilibria with extreme total latency in network congestion games?"],"prefix":"10.1109","author":[{"given":"Heike","family":"Sperber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","article-title":"computers and intractability. a guide to the theory of np-completeness","author":"garey","year":"1979","journal-title":"ser A Series of Books in the Mathematical Sciences"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/506147.506153"},{"journal-title":"Selfish Routing and the Price of Anarchy","year":"2005","author":"roughgarden","key":"16"},{"year":"0","key":"13"},{"key":"14","first-page":"57","article-title":"the price of routing unsplittable flow","author":"awerbuch","year":"2005","journal-title":"Proceedings 37th Annual ACM Symposium on the Theory of Computing (STOC)"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007445"},{"year":"0","key":"12"},{"key":"3","first-page":"404","article-title":"worst-case equilibria","volume":"1563","author":"koutsoupias","year":"1999","journal-title":"ser LNCS"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380883"},{"journal-title":"The Economics of Welfare","year":"1920","author":"pigou","key":"1"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01737559"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.02.019"},{"year":"0","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380846"},{"key":"4","first-page":"413","article-title":"tight bounds for worst-case equilibria","author":"czumaj","year":"2002","journal-title":"Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2008.04.011"},{"year":"0","key":"8"}],"event":{"name":"2009 International Conference on Game Theory for Networks (GameNets)","start":{"date-parts":[[2009,5,13]]},"location":"Istanbul, Turkey","end":{"date-parts":[[2009,5,15]]}},"container-title":["2009 International Conference on Game Theory for Networks"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5076471\/5137364\/05137397.pdf?arnumber=5137397","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,17]],"date-time":"2017-03-17T13:36:10Z","timestamp":1489757770000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5137397\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/gamenets.2009.5137397","relation":{},"subject":[],"published":{"date-parts":[[2009,5]]}}}