{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:21Z","timestamp":1750307001402,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,4]],"date-time":"2012-06-04T00:00:00Z","timestamp":1338768000000},"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":[[2012,6,4]]},"DOI":"10.1145\/2229012.2229056","type":"proceedings-article","created":{"date-parts":[[2012,6,5]],"date-time":"2012-06-05T17:35:37Z","timestamp":1338917737000},"page":"587-604","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Safe opponent exploitation"],"prefix":"10.1145","author":[{"given":"Samuel","family":"Ganzfried","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tuomas","family":"Sandholm","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390166"},{"key":"e_1_3_2_1_3_1","unstructured":"Ganzfried S. and Sandholm T. 2010. Computing equilibria by incorporating qualitative models. AAMAS.   Ganzfried S. and Sandholm T. 2010. Computing equilibria by incorporating qualitative models. AAMAS."},{"key":"e_1_3_2_1_4_1","unstructured":"Ganzfried S. and Sandholm T. 2011. Game theory-based opponent modeling in large imperfect-information games. AAMAS.   Ganzfried S. and Sandholm T. 2011. Game theory-based opponent modeling in large imperfect-information games. AAMAS."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Hawkin J. Holte R. and Szafron D. 2011. Automated action abstraction of imperfect information extensive-form games. AAAI.  Hawkin J. Holte R. and Szafron D. 2011. Automated action abstraction of imperfect information extensive-form games. AAAI.","DOI":"10.1609\/aaai.v25i1.7880"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1100.0452"},{"key":"e_1_3_2_1_8_1","unstructured":"Hoehn B. Southey F. Holte R. C. and Bulitko V. 2005. Effective short-term opponent exploitation in simplified poker. AAAI.   Hoehn B. Southey F. Holte R. C. and Bulitko V. 2005. Effective short-term opponent exploitation in simplified poker. AAAI."},{"key":"e_1_3_2_1_9_1","unstructured":"Johanson M. Zinkevich M. and Bowling M. 2007. Computing robust counter-strategies. NIPS.  Johanson M. Zinkevich M. and Bowling M. 2007. Computing robust counter-strategies. NIPS."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195451"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(97)00023-4"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Kuhn H. W. 1950. Simplified two-person poker. Contributions to the Theory of Games H. W. Kuhn and A. W. Tucker.  Kuhn H. W. 1950. Simplified two-person poker. Contributions to the Theory of Games H. W. Kuhn and A. W. Tucker.","DOI":"10.1515\/9781400881727"},{"volume-title":"AAAI Fall Symposium on Artificial Multi-agent Learning.","author":"McCracken P.","key":"e_1_3_2_1_13_1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-9643-2"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.02.004"},{"key":"e_1_3_2_1_16_1","unstructured":"Waugh K. 2009. Abstraction in large extensive games. M.S. thesis University of Alberta.  Waugh K. 2009. Abstraction in large extensive games. M.S. thesis University of Alberta."},{"key":"e_1_3_2_1_17_1","unstructured":"Zinkevich M. Bowling M. Johanson M. and Piccione C. 2007. Regret minimization in games with incomplete information. NIPS.  Zinkevich M. Bowling M. Johanson M. and Piccione C. 2007. Regret minimization in games with incomplete information. NIPS."}],"event":{"name":"EC '12: ACM Conference on Electronic Commerce","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Valencia Spain","acronym":"EC '12"},"container-title":["Proceedings of the 13th ACM Conference on Electronic Commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2229012.2229056","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2229012.2229056","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:51Z","timestamp":1750236531000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2229012.2229056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,4]]},"references-count":16,"alternative-id":["10.1145\/2229012.2229056","10.1145\/2229012"],"URL":"https:\/\/doi.org\/10.1145\/2229012.2229056","relation":{},"subject":[],"published":{"date-parts":[[2012,6,4]]},"assertion":[{"value":"2012-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}