{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:01Z","timestamp":1725488941755},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540699941"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69995-8_7","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T16:28:21Z","timestamp":1186763301000},"page":"45-51","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of Pure-Strategy Nash Equilibria in Non-Cooperative Games"],"prefix":"10.1007","author":[{"given":"Juliane","family":"Dunke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., A. Dasgupta, J. Kleinberg, \u00c9. Tardos, T. Wexler, and T. Roughgarden (2004). 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.","DOI":"10.1109\/FOCS.2004.68"},{"key":"7_CR2","unstructured":"Chen, X. and X. Deng (2005). 3-Nash is PPAD-complete. Electronic Colloquium on Computational Complexity TR05-134."},{"key":"7_CR3","unstructured":"Chen, X. and X. Deng (2006). Settling the complexity of 2-player Nashequilibrium. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, CA, to appear."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., P. Goldberg, and C. Papadimitriou (2006). The complexity of computing a Nash equilibrium. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, pp. 71\u201378.","DOI":"10.1145\/1132516.1132527"},{"key":"7_CR5","unstructured":"Daskalakis, C. and C. Papadimitriou (2005). Three-player games are hard. Electronic Colloquium on Computational Complexity TR05-139."},{"key":"7_CR6","unstructured":"Dunkel, J. (2005). The Complexity of Pure-Strategy Nash Equilibria in Non-Cooperative Games. Diplomarbeit, Institute of Mathematics, Technische Universit\u00e4t Berlin, Germany, July 2005."},{"key":"7_CR7","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., S. Kontogiannis, and P. Spirakis (2005). Selfish unsplittable flows. Theoretical Computer Science 348, pp. 226\u2013239.","journal-title":"Theoretical Computer Science"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Goldberg, P. and C. Papadimitriou (2006). Reducibility among equilibrium problems. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, pp. 61\u201370.","DOI":"10.1145\/1132516.1132526"},{"key":"7_CR9","unstructured":"Leyton-Brown, K. and M. Tennenholtz (2003). Local-effect games. In Proceedings of the 18th International Joint Conference on Artificial Intelligence, Acapulco, Mexico, pp. 772\u2013780."},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"268","DOI":"10.2307\/1969529","volume":"54","author":"J. Nash","year":"1951","unstructured":"Nash, J. (1951). Non-cooperative games. Annals of Mathematics 54, 268\u2013295.","journal-title":"Annals of Mathematics"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R. Rosenthal","year":"1973","unstructured":"Rosenthal, R. (1973). A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory 2, pp. 65\u201367.","journal-title":"International Journal of Game Theory"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/0220004","volume":"20","author":"A. Sch\u00e4ffer","year":"1991","unstructured":"Sch\u00e4ffer, A. and M. Yannakakis (1991). Simple local search problems that are hard to solve. SIAM Journal on Computing 20, pp. 56\u201387.","journal-title":"SIAM Journal on Computing"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69995-8_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:06:32Z","timestamp":1605762392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69995-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540699941"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69995-8_7","relation":{},"subject":[]}}