{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:06:11Z","timestamp":1743134771088,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681380"},{"type":"electronic","value":"9783540681410"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11944874_7","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T18:41:09Z","timestamp":1164652869000},"page":"62-73","source":"Crossref","is-referenced-by-count":7,"title":["On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games"],"prefix":"10.1007","author":[{"given":"Juliane","family":"Dunkel","sequence":"first","affiliation":[]},{"given":"Andreas S.","family":"Schulz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structure on congestion games. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, CA (to appear, 2006a)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/11944874_6","volume-title":"Internet and Network Economics","author":"H. Ackermann","year":"2006","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: Pure Nash equilibria in player-specific and weighted congestion games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.\u00a04286, pp. 50\u201361. Springer, Heidelberg (2006b)"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/11549345_10","volume-title":"Mathematical Foundations of Computer Science 2005","author":"C. \u00c0lvarez","year":"2005","unstructured":"\u00c0lvarez, C., Gabarr\u00f3, J., Serna, M.: Pure Nash equilibria in games with a large number of actions. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 95\u2013106. Springer, Heidelberg (2005)"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, Rome, Italy, pp. 295\u2013304 (2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, pp. 57\u201366 (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"7_CR6","unstructured":"Brandt, F., Fischer, F., Holzer, M.: Symmetries and the complexity of pure Nash equilibrium. Electronic Colloquium on Computational Complexity, TR06-091 (2006)"},{"key":"7_CR7","unstructured":"Chen, X., Deng, X.: 3-Nash is PPAD-complete. Electronic Colloquium on Computational Complexity, TR05-134 (2005)"},{"key":"7_CR8","unstructured":"Chen, X., Deng, X.: Settling the complexity of 2-player Nash-equilibrium. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, CA (to appear, 2006)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Goldberg, P., Papadimitriou, C.: The complexity of computing a Nash equilibrium. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, pp. 71\u201378 (2006)","DOI":"10.1145\/1132516.1132527"},{"key":"7_CR10","unstructured":"Daskalakis, C., Papadimitriou, C.: Three-player games are hard. Electronic Colloquium on Computational Complexity, TR05-139 (2005)"},{"key":"7_CR11","unstructured":"Dunkel, J.: The Complexity of Pure-Strategy Nash Equilibria in Non-Cooperative Games. Diplomarbeit, Institute of Mathematics, Technische Universit\u00e4t Berlin, Germany (July 2005)"},{"key":"7_CR12","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 Theory of Computing, Chicago, IL, pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.ipl.2006.03.010","volume":"99","author":"F. Fischer","year":"2006","unstructured":"Fischer, F., Holzer, M., Katzenbeisser, S.: The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria. Information Processing Letters\u00a099, 239\u2013245 (2006)","journal-title":"Information Processing Letters"},{"key":"7_CR14","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.: Selfish unsplittable flows. Theoretical Computer Science\u00a0348, 226\u2013239 (2005)","journal-title":"Theoretical Computer Science"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Goemans, M., Mirrokni, V., Vetta, A.: Sink equilibria and convergence. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, Pittsburgh, PA, pp. 142\u2013154 (2005)","DOI":"10.1109\/SFCS.2005.68"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Goldberg, P., Papadimitriou, C.: Reducibility among equilibrium problems. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, pp. 61\u201370 (2006)","DOI":"10.1145\/1132516.1132526"},{"key":"7_CR17","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1613\/jair.1683","volume":"24","author":"G. Gottlob","year":"2005","unstructured":"Gottlob, G., Greco, G., Scarcello, F.: Pure Nash equilibria: Hard and easy games. Journal of Artificial Intelligence Research\u00a024, 357\u2013406 (2005)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"7_CR18","unstructured":"Ieong, S., McGrew, R., Nudelman, E., Shoham, Y., Sun, Q.: Fast and compact: A simple class of congestion games. In: Proceedings of the 20th National Conference on Artificial Intelligence and the 17th Innovative Applications of Artificial Intelligence Conference, Pittsburgh, PA, pp. 489\u2013494 (2005)"},{"key":"7_CR19","unstructured":"Leyton-Brown, K., Tennenholtz, M.: Local-effect games. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence, Acapulco, Mexico, pp. 772\u2013780 (2003)"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/game.1996.0027","volume":"13","author":"I. Milchtaich","year":"1996","unstructured":"Milchtaich, I.: Congestion games with player-specific payoff functions. Games and Economic Behavior\u00a013, 111\u2013124 (1996)","journal-title":"Games and Economic Behavior"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"268","DOI":"10.2307\/1969529","volume":"54","author":"J. Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative games. Annals of Mathematics\u00a054, 268\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R. Rosenthal","year":"1973","unstructured":"Rosenthal, R.: A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/0220004","volume":"20","author":"A. Sch\u00e4ffer","year":"1991","unstructured":"Sch\u00e4ffer, A., Yannakakis, M.: Simple local search problems that are hard to solve. SIAM Journal on Computing\u00a020, 56\u201387 (1991)","journal-title":"SIAM Journal on Computing"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Schoenebeck, G., Vadhan, S.: The computational complexity of Nash equilibria in concisely represented games. In: Proceedings of the 7th ACM Conference on Electronic Commerce, Ann Arbor, MI, pp. 270\u2013279 (2006)","DOI":"10.1145\/1134707.1134737"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944874_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T04:50:10Z","timestamp":1736657410000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944874_7"}},"subtitle":["\u2013Extended Abstract\u2013"],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540681380","9783540681410"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11944874_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}