{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:39:59Z","timestamp":1725521999815},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540921844"},{"type":"electronic","value":"9783540921851"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92185-1_17","type":"book-chapter","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T16:44:33Z","timestamp":1228927473000},"page":"82-93","source":"Crossref","is-referenced-by-count":1,"title":["How Hard Is It to Find Extreme Nash Equilibria in Network Congestion Games?"],"prefix":"10.1007","author":[{"given":"Elisabeth","family":"Gassner","sequence":"first","affiliation":[]},{"given":"Johannes","family":"Hatzl","sequence":"additional","affiliation":[]},{"given":"Sven O.","family":"Krumke","sequence":"additional","affiliation":[]},{"given":"Heike","family":"Sperber","sequence":"additional","affiliation":[]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","volume-title":"The economics of welfare","author":"A.C. Pigou","year":"1920","unstructured":"Pigou, A.C.: The economics of welfare. Macmillan, Basingstoke (1920)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.: Algorithms, games, and the internet. In: Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-45465-9_12","volume-title":"Automata, Languages and Programming","author":"D. Fotakis","year":"2002","unstructured":"Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., Spirakis, P.: The structure and complexity of nash equilibria for a selfish routing game. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 123\u2013134. Springer, Heidelberg (2002)"},{"issue":"1-2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.tcs.2005.05.011","volume":"343","author":"M. Gairing","year":"2005","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B., Spirakis, P.: The structure and complexity of extreme nash equilibria. Theoretical Computer Science\u00a0343(1-2), 133\u2013157 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.tcs.2007.02.019","volume":"378","author":"S. Fischer","year":"2007","unstructured":"Fischer, S., V\u00f6cking, B.: On the structure and complexity of worst-case equilibria. Theororetical Computer Science\u00a0378(2), 165\u2013174 (2007)","journal-title":"Theororetical Computer Science"},{"key":"17_CR7","unstructured":"Epstein, A., Feldman, M., Mansour, Y.: Efficient graph topologies in network routing games. In: Joint Workshop on Economics of Networked Systems and Incentive-Based Computing (2007)"},{"issue":"1","key":"17_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy nash equilibria. International Journal of Game Theory\u00a02(1), 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure nash equilibria. In: Proceedings of the 36th Annual ACM Symposium on the Theory of Computing, pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/11671411_13","volume-title":"Approximation and Online Algorithms","author":"D. Fotakis","year":"2005","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.: Symmetry in network congestion games: Pure equilibria and anarchy cost. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol.\u00a03879, pp. 161\u2013175. Springer, Heidelberg (2005)"},{"key":"17_CR11","series-title":"A Series of Books in the Mathematical Sciences","volume-title":"Computers and intractability. A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. A guide to the theory of NP-completeness. A Series of Books in the Mathematical Sciences. W. H. Freeman & Co., New York (1979)"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0166-218X(85)90006-X","volume":"10","author":"W.W. Bein","year":"1985","unstructured":"Bein, W.W., Brucker, P., Tamir, A.: Minimum cost flow algorithm for series-parallel networks. Discrete Applied Mathematics\u00a010, 117\u2013124 (1985)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92185-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,19]],"date-time":"2019-01-19T10:03:51Z","timestamp":1547892231000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92185-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921844","9783540921851"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92185-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}