{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T20:59:32Z","timestamp":1774385972897,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,5,8]],"date-time":"2006-05-08T00:00:00Z","timestamp":1147046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,5,8]]},"DOI":"10.1145\/1160633.1160731","type":"proceedings-article","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T18:04:00Z","timestamp":1161194640000},"page":"537-544","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["A technique for reducing normal-form games to compute a Nash equilibrium"],"prefix":"10.1145","author":[{"given":"Vincent","family":"Conitzer","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tuomas","family":"Sandholm","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,5,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1036843.1036848"},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI)","author":"Blum B.","year":"2003","unstructured":"B. Blum, C. R. Shelton, and D. Koller. A continuation method for Nash equilibria in structured games. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI), Acapulco, Mexico, 2003."},{"key":"e_1_3_2_1_3_1","volume-title":"Report No. 134","author":"Chen X.","year":"2005","unstructured":"X. Chen and X. Deng. 3-Nash is PPAD-complete. Electronic Colloquium on Computational Complexity, Report No. 134, 2005."},{"key":"e_1_3_2_1_4_1","volume-title":"Report No. 150","author":"Chen X.","year":"2005","unstructured":"X. Chen and X. Deng. Settling the Complexity of 2-player Nash equilibrium. Electronic Colloquium on Computational Complexity, Report No. 150, 2005."},{"key":"e_1_3_2_1_5_1","first-page":"765","volume-title":"Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI)","author":"Conitzer V.","year":"2003","unstructured":"V. Conitzer and T. Sandholm. Complexity results about Nash equilibria. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI), pages 765--771, Acapulco, Mexico, 2003."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064009.1064019"},{"key":"e_1_3_2_1_7_1","first-page":"483","volume-title":"Proceedings of the National Conference on Artificial Intelligence (AAAI)","author":"Conitzer V.","year":"2005","unstructured":"V. Conitzer and T. Sandholm. A generalized strategy eliminability criterion and computational methods for applying it. In Proceedings of the National Conference on Artificial Intelligence (AAAI), pages 483--488, Pittsburgh, PA, USA, 2005."},{"key":"e_1_3_2_1_8_1","volume-title":"Report No. 115","author":"Daskalakis C.","year":"2005","unstructured":"C. Daskalakis, P. Goldberg, and C. Papadimitriou. The complexity of computing a Nash equilibrium. Electronic Colloquium on Computational Complexity, Report No. 115, 2005."},{"key":"e_1_3_2_1_9_1","volume-title":"Report No. 139","author":"Daskalakis C.","year":"2005","unstructured":"C. Daskalakis and C. Papadimitriou. Three-player games are hard. Electronic Colloquium on Computational Complexity, Report No. 139, 2005."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.18.3.553"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0899-8256(89)90006-7"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/846241.846269"},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI)","author":"Kearns M.","year":"2001","unstructured":"M. Kearns, M. Littman, and S. Singh. Graphical models for game theory. In Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI), 2001."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(88)90075-2"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0112033"},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI)","author":"Leyton-Brown K.","year":"2003","unstructured":"K. Leyton-Brown and M. Tennenholtz. Local-effect games. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI), Acapulco, Mexico, 2003."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/779928.779933"},{"key":"e_1_3_2_1_18_1","volume-title":"Games and Decisions","author":"Luce R. D.","year":"1957","unstructured":"R. D. Luce and H. Raiffa. Games and Decisions. John Wiley and Sons, New York, 1957. Dover republication 1989."},{"key":"e_1_3_2_1_19_1","volume-title":"Game Theory: Analysis of Conflict Harvard University Press","author":"Myerson R.","year":"1991","unstructured":"R. Myerson. Game Theory: Analysis of Conflict Harvard University Press, Cambridge, 1991."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.36.1.48"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1018410.1018840"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380883"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1597148.1597255"},{"key":"e_1_3_2_1_24_1","first-page":"495","volume-title":"Proceedings of the National Conference on Artificial Intelligence (AAAI)","author":"Sandholm T.","year":"2005","unstructured":"T. Sandholm, A. Gilpin, and V. Conitzer. Mixed-integer programming methods for finding Nash equilibria. In Proceedings of the National Conference on Artificial Intelligence (AAAI), pages 495--501, Pittsburgh, PA, USA, 2005."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.28"}],"event":{"name":"AAMAS06: AAMAS '06 - 5th International Joint Conference on Autonomous Agents and Multi-agent Systems 2006","location":"Hakodate Japan","acronym":"AAMAS06","sponsor":["IFMAS The International Foundation for Multiagent Systems","SIGAI ACM Special Interest Group on Artificial Intelligence","ATAL The International Workshop on Agent Theories, Architectures, and Languages"]},"container-title":["Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1160633.1160731","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1160633.1160731","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T17:31:14Z","timestamp":1774373474000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1160633.1160731"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,8]]},"references-count":25,"alternative-id":["10.1145\/1160633.1160731","10.1145\/1160633"],"URL":"https:\/\/doi.org\/10.1145\/1160633.1160731","relation":{},"subject":[],"published":{"date-parts":[[2006,5,8]]},"assertion":[{"value":"2006-05-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}