{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:08:30Z","timestamp":1761620910830},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287025"},{"type":"electronic","value":"9783540318675"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11549345_10","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:05:47Z","timestamp":1127829947000},"page":"95-106","source":"Crossref","is-referenced-by-count":14,"title":["Pure Nash Equilibria in Games with a Large Number of Actions"],"prefix":"10.1007","author":[{"given":"Carme","family":"\u00c0lvarez","sequence":"first","affiliation":[]},{"given":"Joaquim","family":"Gabarr\u00f3","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Serna","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"\u00c0lvarez, C., Gabarr\u00f3, J., Serna, M.: Pure Nash equilibria in games with a large number of actions. Technical Report\u00a031, Electronic Colloquium on Computational Complexity (2005)","DOI":"10.1007\/11549345_10"},{"key":"10_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-75357-2","volume-title":"Structural Complexity\u00a0II","author":"J.L. Balcazar","year":"1990","unstructured":"Balcazar, J.L., D\u00edaz, J., Gabarr\u00f3, J.: Structural Complexity\u00a0II. Springer, Heidelberg (1990)"},{"key":"10_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-79235-9","volume-title":"Structural Complexity\u00a0I","author":"J.L. Balcazar","year":"1995","unstructured":"Balcazar, J.L., D\u00edaz, J., Gabarr\u00f3, J.: Structural Complexity\u00a0I, 2nd edn. Springer, Heidelberg (1995)","edition":"2"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0899-8256(90)90010-R","volume":"2","author":"E. Ben-Porath","year":"1990","unstructured":"Ben-Porath, E.: The complexity of computing a best response automaton in repeated games with mixed strategies. Games and Economic Behavior\u00a02(1), 1\u201312 (1990)","journal-title":"Games and Economic Behavior"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Chu, F., Halpern, J.: On the NP-completeness of finding an optimal strategy in games with commons pay-offs. International Journal of Game Theory (2001)","DOI":"10.1007\/s001820100066"},{"key":"10_CR6","unstructured":"Conitzer, V., Sandholm, T.: Complexity results about Nash equilibra. In: IJCAI 2003, pp. 765\u2013771 (2003)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Daskalakis, K., Papadimitriou, C.: The complexity of games on highly regular graphs. Technical report (2005), available at http:\/\/www.cs.berkeley.edu\/christos\/","DOI":"10.1007\/11561071_9"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: STOC 2004, pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"10_CR9","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.A. Fotakis","year":"2002","unstructured":"Fotakis, D.A., Kontogiannis, S.C., Koutsoupias, E., Mavronicolas, M., Spirakis, P.G.: 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)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-540-27836-8_51","volume-title":"Automata, Languages and Programming","author":"D. Fotakis","year":"2004","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.: Selfish unsplittable flows. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 593\u2013605. Springer, Heidelberg (2004)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/978-3-540-27836-8_55","volume-title":"Automata, Languages and Programming","author":"M. Gairing","year":"2004","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M.: Nash equilibria in discrete routing games with convex latency functions. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 645\u2013657. Springer, Heidelberg (2004)"},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0899-8256(89)90006-7","volume":"1","author":"I. Gilboa","year":"1989","unstructured":"Gilboa, I., Zemel, E.: Nash and correlated equilibria. Games and Economic Behavior\u00a01(1), 80\u201393 (1989)","journal-title":"Games and Economic Behavior"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Greco, G., Scarcello, F.: Pure Nash equilibria: Hard and easy games. Theoretical Aspects of Rationality and Knowledge, 215\u2013230 (2003)","DOI":"10.1145\/846241.846269"},{"issue":"4","key":"10_CR14","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/0899-8256(92)90035-Q","volume":"4","author":"D. Koller","year":"1992","unstructured":"Koller, D., Megiddo, M.: The complexity of two-person zero sum games in extensive form. Games and Economic Behavior\u00a04(4), 528\u2013552 (1992)","journal-title":"Games and Economic Behavior"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Nash, J.: Non-cooperative games. Annals of Mathematics, 286\u2013295 (1951)","DOI":"10.2307\/1969529"},{"key":"10_CR16","volume-title":"A Course in Game Theory","author":"M.J. Osborne","year":"1994","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/0899-8256(92)90008-G","volume":"4","author":"C. Papadimitriou","year":"1992","unstructured":"Papadimitriou, C.: On players with a bounded number of actions. Games and Economic Behavior\u00a04(1), 122\u2013131 (1992)","journal-title":"Games and Economic Behavior"},{"key":"10_CR18","volume-title":"Computational Complexity","author":"C. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.: Algorithms, games and the internet. In: STOC 2001, pp. 4\u20138 (2001)","DOI":"10.1145\/380752.380883"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Schoenebeck, G.R., Vadham, S.: The complexity of Nash equilibria in concisely represented games. Technical Report\u00a052, Electronic Colloquium on Computational Complexity (2005)","DOI":"10.1145\/1134707.1134737"},{"key":"10_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45303-2","volume-title":"The computational complexity of equivalence and isomorphisms problems","author":"T. Thierauf","year":"2000","unstructured":"Thierauf, T.: The computational complexity of equivalence and isomorphisms problems. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549345_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:41:08Z","timestamp":1605642068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549345_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287025","9783540318675"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11549345_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}