{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:17:43Z","timestamp":1725560263417},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281931"},{"type":"electronic","value":"9783540318736"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11537311_18","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T10:00:06Z","timestamp":1127815206000},"page":"197-208","source":"Crossref","is-referenced-by-count":6,"title":["On the Complexity of Uniformly Mixed Nash Equilibria and Related Regular Subgraph Problems"],"prefix":"10.1007","author":[{"given":"Vincenzo","family":"Bonifaci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"Di Iorio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luigi","family":"Laura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"18_CR1","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. Inform. Proc. Letters\u00a094(3), 145\u2013150 (2005)","journal-title":"Inform. Proc. Letters"},{"key":"18_CR2","unstructured":"Conitzer, V., Sandholm, T.: Complexity results about Nash equilibria. In: Proc. 18th Int. Joint Conf. on Artificial Intelligence, pp. 765\u2013771 (2003)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The Complexity of Pure Nash Equilibria. In: Proc. 36th Symp. on Theory of Computing, pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"18_CR4","volume-title":"Computers and intractability. A guide to the theory of NP-completeness","author":"M. Garey","year":"1978","unstructured":"Garey, M., Johnson, D.: Computers and intractability. A guide to the theory of NP-completeness. Freeman, New York (1978)"},{"issue":"1","key":"18_CR5","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"},{"key":"18_CR6","unstructured":"McLennan, A., Tourky, R.: Simple complexity from imitation games (2005), Available at \n                    \n                      http:\/\/www.econ.umn.edu\/~mclennan\/Papers\/papers.html"},{"key":"18_CR7","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. Proc. of the National Academy of Sciences\u00a036, 48\u201349 (1950)","journal-title":"Proc. of the National Academy of Sciences"},{"issue":"3","key":"18_CR8","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 Systems Sciences\u00a048(3), 498\u2013532 (1994)","journal-title":"Journal of Computer and Systems Sciences"},{"key":"18_CR9","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 Symp. Foundations of Computer Science, pp. 258\u2013267 (2004)","DOI":"10.1109\/FOCS.2004.28"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node- and edge-deletion NP-complete problems. In: Proc. 10th Symp. Foundations of Computer Science, pp. 253\u2013264 (1978)","DOI":"10.1145\/800133.804355"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11537311_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T02:38:19Z","timestamp":1552790299000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11537311_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281931","9783540318736"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11537311_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}