{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T21:46:32Z","timestamp":1768340792323,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540709176","type":"print"},{"value":"9783540709183","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70918-3_19","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T19:41:23Z","timestamp":1179949283000},"page":"212-223","source":"Crossref","is-referenced-by-count":4,"title":["Symmetries and the Complexity of Pure Nash Equilibrium"],"prefix":"10.1007","author":[{"given":"Felix","family":"Brandt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felix","family":"Fischer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Holzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/0213028","volume":"13","author":"A.K. Chandra","year":"1984","unstructured":"Chandra, A.K., Stockmeyer, L., Vishkin, U.: Constant depth reducibility. SIAM Journal on Computing\u00a013(2), 423\u2013439 (1984)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR2","first-page":"604","volume-title":"Proceedings of the 36th Annual ACM Symposium on the Theory of Computing (STOC)","author":"A. Fabrikant","year":"2004","unstructured":"Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure Nash equilibria. In: Proceedings of the 36th Annual ACM Symposium on the Theory of Computing (STOC), pp. 604\u2013612. ACM Press, New York (2004)"},{"issue":"6","key":"19_CR3","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(6), 239\u2013245 (2006)","journal-title":"Information Processing Letters"},{"key":"19_CR4","first-page":"81","volume-title":"Contributions to the Theory of Games, vol. 1","author":"D. Gale","year":"1950","unstructured":"Gale, D., Kuhn, H.W., Tucker, A.W.: On symmetric games. In: Kuhn, H.W., Tucker, A.W. (eds.) Contributions to the Theory of Games, vol. 1, pp. 81\u201387. Princeton University Press, Princeton (1950)"},{"key":"19_CR5","first-page":"67","volume-title":"Handbook of Theoretical Computer Science, vol. A","author":"D.S. Johnson","year":"1990","unstructured":"Johnson, D.S.: A catalog of complexity classes. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. A, pp. 67\u2013161. Elsevier, Amsterdam (1990)"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How easy is local search? Journal of Computer and System Sciences\u00a037, 79\u2013100 (1988)","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR7","volume-title":"Games and Decisions: Introduction and Critical Survey","author":"R.D. Luce","year":"1957","unstructured":"Luce, R.D., Raiffa, H.: Games and Decisions: Introduction and Critical Survey. Wiley, Chichester (1957)"},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J.F. Nash","year":"1951","unstructured":"Nash, J.F.: Non-cooperative games. Annals of Mathematics\u00a054(2), 286\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"key":"19_CR9","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"19_CR10","first-page":"82","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"C.H. Papadimitriou","year":"2005","unstructured":"Papadimitriou, C.H., Roughgarden, T.: Computing equilibria in multi-player games. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 82\u201391. SIAM, Philadelphia (2005)"},{"issue":"4","key":"19_CR11","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R. Parikh","year":"1966","unstructured":"Parikh, R.: On context-free languages. Journal of the ACM\u00a013(4), 570\u2013581 (1966)","journal-title":"Journal of the ACM"},{"issue":"1","key":"19_CR12","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/0220004","volume":"20","author":"A.A. Sch\u00e4ffer","year":"1991","unstructured":"Sch\u00e4ffer, A.A., Yannakakis, M.: Simple local search problems that are hard to solve. SIAM Journal on Computing\u00a020(1), 56\u201387 (1991)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR13","volume-title":"Proceedings of the 7th ACM Conference on Electronic Commerce (ACM-EC)","author":"G. Schoenebeck","year":"2006","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 (ACM-EC), ACM Press, New York (2006)"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01448847","volume":"100","author":"J. Neumann von","year":"1928","unstructured":"von Neumann, J.: Zur Theorie der Gesellschaftspiele. Mathematische Annalen\u00a0100, 295\u2013320 (1928)","journal-title":"Mathematische Annalen"},{"key":"19_CR15","volume-title":"The Theory of Games and Economic Behavior","author":"J. Neumann von","year":"1947","unstructured":"von Neumann, J., Morgenstern, O.: The Theory of Games and Economic Behavior, 2nd edn. Princeton University Press, Princeton (1947)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:11:47Z","timestamp":1605744707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709176","9783540709183"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_19","relation":{},"subject":[]}}