{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:57:40Z","timestamp":1725551860128},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309000"},{"type":"electronic","value":"9783540322931"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11600930_103","type":"book-chapter","created":{"date-parts":[[2005,11,24]],"date-time":"2005-11-24T09:48:12Z","timestamp":1132825692000},"page":"1023-1032","source":"Crossref","is-referenced-by-count":3,"title":["New Results on the Complexity of Uniformly Mixed Nash Equilibria"],"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":[{"key":"103_CR1","doi-asserted-by":"crossref","unstructured":"Bonifaci, V., Iorio, U.D., Laura, L.: On the complexity of uniformly mixed Nash equilibria and related regular subgraph problems. In: Proc. 15th Symp. on Fundamentals of Computation Theory (2005)","DOI":"10.1007\/11537311_18"},{"issue":"3","key":"103_CR2","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":"103_CR3","unstructured":"Conitzer, V., Sandholm, T.: Complexity results about Nash equilibria. In: Proc. 18th Int. Joint Conf. on Artificial Intelligence, pp. 765\u2013771 (2003)"},{"key":"103_CR4","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":"103_CR5","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":"103_CR6","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":"103_CR7","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Koutsoupias, E., Papadimitriou, C.H., Shenker, S.: Optimization problems in congestion control. In: Proc. 41st Symp. on Foundations of Computer Science, pp. 66\u201374 (2000)","DOI":"10.1109\/SFCS.2000.892066"},{"key":"103_CR8","unstructured":"McLennan, A., Tourky, R.: Simple complexity from imitation games (2005), Available at: http:\/\/www.econ.umn.edu\/~mclennan\/Papers\/papers.html"},{"key":"103_CR9","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"},{"key":"103_CR10","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. In: Proc. 31st Symp. on Theory of Computing, pp. 129\u2013140 (1999)","DOI":"10.1145\/301250.301287"},{"issue":"3","key":"103_CR11","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":"103_CR12","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, games and the Internet. In: Proc. 33rd Symp. on Theory of Computing, pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"issue":"2","key":"103_CR13","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? Journal of the ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"Journal of the ACM"},{"key":"103_CR14","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. on Foundations of Computer Science, pp. 258\u2013267 (2004)","DOI":"10.1109\/FOCS.2004.28"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11600930_103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:34:33Z","timestamp":1586568873000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11600930_103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309000","9783540322931"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11600930_103","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}