{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T05:35:54Z","timestamp":1736573754302,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540388753"},{"type":"electronic","value":"9783540388760"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_23","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T13:20:54Z","timestamp":1157980854000},"page":"232-243","source":"Crossref","is-referenced-by-count":13,"title":["Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Codenotti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauro","family":"Leoncini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Resta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Abbott, T., Kane, D., Valiant, P.: On the Complexity of Two-Player Win-Lose Games. In: Proc. 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 113\u2013122 (2005)","DOI":"10.1109\/SFCS.2005.59"},{"key":"23_CR2","unstructured":"Chen, X., Deng, X.: 3-NASH is PPAD-Complete, ECCC TR05-134 (2005)"},{"key":"23_CR3","unstructured":"Chen, X., Deng, X.: Settling the Complexity of 2-Player Nash-Equilibrium, ECCC TR05-140 (2005)"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Codenotti, B., Leoncini, M., Resta, G.: Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Games, ECCC Technical Report TR06-012. Available at: http:\/\/eccc.hpi-web.de\/eccc-reports\/2006\/TR06-012\/index.html","DOI":"10.1007\/11841036_23"},{"issue":"3","key":"23_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., Stefankovic, 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"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Goldberg, P., Papadimitriou, C.: The complexity of computing a Nash equilibrium, ECCC TR05-115 (2005)","DOI":"10.1145\/1132516.1132527"},{"key":"23_CR7","unstructured":"Daskalakis, C., Papadimitriou, C.: Three-Player Games Are Hard, ECCC TR05-139 (2005)"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Goldberg, P.W., Papadimitriou, C.: Reducibility Among Equilibrium Problems, ECCC TR05-090 (2005)","DOI":"10.1145\/1132516.1132526"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0112033","volume":"12","author":"C.E. Lemke","year":"1964","unstructured":"Lemke, C.E., Howson, J.T.: Equilibrium points in bimatrix games. Journal of the Society for Industrial and Applied Mathematics\u00a012, 413\u2013423 (1964)","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"issue":"2","key":"23_CR10","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J. Nash","year":"1951","unstructured":"Nash, J.: Non-Cooperative Games. Annals of Mathematics\u00a054(2), 286\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","volume":"48","author":"C. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: On the Complexity of the Parity Argument and other Inefficient Proofs of Existence. Journal of Computer and System Sciences\u00a048, 498\u2013532 (1994)","journal-title":"Journal of Computer and System Sciences"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Savani, R., von Stengel, B.: Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game. In: Proc. 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 258\u2013267 (2004)","DOI":"10.1109\/FOCS.2004.28"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T20:33:15Z","timestamp":1736541195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11841036_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}