{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T04:16:45Z","timestamp":1741839405820,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642248283"},{"type":"electronic","value":"9783642248290"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24829-0_19","type":"book-chapter","created":{"date-parts":[[2011,10,3]],"date-time":"2011-10-03T13:11:38Z","timestamp":1317647498000},"page":"200-211","source":"Crossref","is-referenced-by-count":1,"title":["Complexity of Rational and Irrational Nash Equilibria"],"prefix":"10.1007","author":[{"given":"Vittorio","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"Marios","family":"Mavronicolas","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Abbott, T., Kane, D., Valiant, P.: On the Complexity of Two-Player Win-Lose Games. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Sciences, pp. 113\u2013122 (October 2005)","key":"19_CR1","DOI":"10.1109\/SFCS.2005.59"},{"unstructured":"Austrin, P., Braverman, M., Chlamt\u00e1\u010d, E.: Inapproximability of NP-complete Variants of Nash Equilibrium, arXiv:1104.3760v1, April 19 (2001)","key":"19_CR2"},{"issue":"1","key":"19_CR3","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.geb.2009.04.016","volume":"70","author":"C. Borgs","year":"2010","unstructured":"Borgs, C., Chayes, J., Immorlica, N., Tauman Kalai, A., Mirrokni, V., Papadimitriou, C.H.: The Myth of the Folk Theorem. Games and Economic Behavior\u00a070(1), 34\u201343 (2010)","journal-title":"Games and Economic Behavior"},{"doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X., Teng, S.H.: Settling the Complexity of Computing Two-Player Nash Equilibria. Journal of the ACM\u00a056(3) (2009)","key":"19_CR4","DOI":"10.1145\/1516512.1516516"},{"issue":"3","key":"19_CR5","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.ipl.2005.01.010","volume":"94","author":"B. Codenotti","year":"2005","unstructured":"Codenotti, B., Stefanovic, D.: On the Computational Complexity of Nash Equilibria for (0, 1) Bimatrix Games. Information Processing Letters\u00a094(3), 145\u2013150 (2005)","journal-title":"Information Processing Letters"},{"unstructured":"Conitzer, V., Sandholm, T.: Complexity Results about Nash Equilibria. In: Proceedings of the 18th Joint Conference on Artificial Intelligence, pp. 765\u2013771 (August 2003)","key":"19_CR6"},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1016\/j.geb.2008.02.015","volume":"63","author":"V. Conitzer","year":"2008","unstructured":"Conitzer, V., Sandholm, T.: New Complexity Results about Nash Equilibria. Games and Economic Behavior\u00a063(2), 621\u2013641 (2008)","journal-title":"Games and Economic Behavior"},{"issue":"1","key":"19_CR8","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/070699652","volume":"39","author":"C. Daskalakis","year":"2009","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The Complexity of Computing a Nash Equilibrium. SIAM Journal on Computing\u00a039(1), 195\u2013259 (2009)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"19_CR9","doi-asserted-by":"publisher","first-page":"2531","DOI":"10.1137\/080720826","volume":"39","author":"K. Etessami","year":"2010","unstructured":"Etessami, K., Yannakakis, M.: On the Complexity of Nash Equilibria and Other Fixed Points. SIAM Journal on Computing\u00a039(6), 2531\u20132597 (2010)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-16170-4_1","volume-title":"Algorithmic Game Theory","author":"A. Fiat","year":"2010","unstructured":"Fiat, A., Papadimitriou, C.H.: When Players are not Expectation Maximizers. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) Algorithmic Game Theory. LNCS, vol.\u00a06386, pp. 1\u201314. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S.: Some NP-complete geometric problems. In: Proceedings of the 8th Annual ACM Symposium on Theory of Computing, pp. 10\u201322 (1976)","key":"19_CR11","DOI":"10.1145\/800113.803626"},{"key":"19_CR12","volume-title":"Computers and Intractability \u2014 A Guide to the Theory of ${\\cal NP}$ -Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability \u2014 A Guide to the Theory of ${\\cal NP}$ -Completeness. W.H. Freeman, New York (1979)"},{"issue":"1","key":"19_CR13","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: Some Complexity Considerations. Games and Economic Behavior\u00a01(1), 80\u201393 (1989)","journal-title":"Games and Economic Behavior"},{"unstructured":"Koutsoupias, E.: Personal communication during. In: 2nd International Symposium on Algorithmic Game Theory, Paphos, Cyprus (October 2009)","key":"19_CR14"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/978-3-540-77105-0_51","volume-title":"Internet and Network Economics","author":"M. Mavronicolas","year":"2007","unstructured":"Mavronicolas, M., Monien, B., Wagner, K.K.: Weighted Boolean Formula Games. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol.\u00a04858, pp. 469\u2013481. Springer, Heidelberg (2007)"},{"issue":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1016\/j.geb.2009.10.003","volume":"68","author":"A. McLennan","year":"2010","unstructured":"McLennan, A., Tourky, R.: Simple Complexity from Imitation Games. Games abd Economic Behavior\u00a068(2), 683\u2013688 (2010)","journal-title":"Games abd Economic Behavior"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J.F. Nash","year":"1950","unstructured":"Nash, J.F.: Equilibrium Points in n-Person Games. Proceedings of the National Academy of Sciences of the United States of America\u00a036, 48\u201349 (1950)","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"issue":"2","key":"19_CR18","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"},{"issue":"3","key":"19_CR19","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","volume":"48","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence. Journal of Computer and System Sciences\u00a048(3), 498\u2013532 (1994)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24829-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T11:09:35Z","timestamp":1741777775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24829-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642248283","9783642248290"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24829-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}