{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T19:46:51Z","timestamp":1769975211409,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,21]],"date-time":"2017-07-21T00:00:00Z","timestamp":1500595200000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ARO","award":["W911NF-16-1-0061"],"award-info":[{"award-number":["W911NF-16-1-0061"]}]},{"name":"NSF","award":["IIS-1546752, IIS- 1320620"],"award-info":[{"award-number":["IIS-1546752, IIS- 1320620"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,21]]},"DOI":"10.1145\/2940716.2940736","type":"proceedings-article","created":{"date-parts":[[2016,7,21]],"date-time":"2016-07-21T11:20:09Z","timestamp":1469100009000},"page":"459-476","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Imperfect-Recall Abstractions with Bounds in Games"],"prefix":"10.1145","author":[{"given":"Christian","family":"Kroer","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":[[2016,7,21]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"ACPC. 2016. Annual Computer Poker Competition website. http:\/\/www.computerpokercompetition.org\/. {Online; accessed 23-Feb-2016}."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","unstructured":"Basilico N. and Gatti N. 2011. Automated abstractions for patrolling security games. In AAAI-11.","DOI":"10.5555\/2900423.2900597"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1259433"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","unstructured":"Brown N. Ganzfried S. and Sandholm T. 2015. Hierarchical abstraction distributed equilibrium computation and post-processing with application to a champion no-limit Texas Hold'em agent. In AAMAS-15.","DOI":"10.5555\/2772879.2772885"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","unstructured":"Brown N. and Sandholm T. 2015. Simultaneous abstraction and equilibrium finding in games. In IJCAI-15.","DOI":"10.5555\/2832249.2832317"},{"key":"e_1_3_2_1_6_1","unstructured":"Chen K. and Bowling M. 2012. Tractable objectives for robust policy optimization. In NIPS-12."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","unstructured":"Feder T. and Greene D. 1988. Optimal algorithms for approximate clustering. In STOC-88. 10.1145\/62212.62255","DOI":"10.1145\/62212.62255"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","unstructured":"Ganzfried S. and Sandholm T. 2015. Endgame solving in large imperfect-information games. In AAMAS-15.","DOI":"10.5555\/2772879.2772888"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","unstructured":"Gilpin A. and Sandholm T. 2007a. Better automated abstraction techniques for imperfect information games with application to Texas Hold'em poker. In AAMAS-07. 10.1145\/1329125.1329358","DOI":"10.1145\/1329125.1329358"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284324"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","unstructured":"Gilpin A. Sandholm T. and S\u00f8rensen T. B. 2007. Potential-aware automated abstraction of sequential games and holistic equilibrium analysis of Texas Hold'em poker. In AAAI-07.","DOI":"10.5555\/1619645.1619655"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Gonzalez T. F. 1985. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science 38.","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","unstructured":"Halpern J. Y. and Pass R. 2013. Sequential equilibrium in computational games. In IJCAI-13.","DOI":"10.5555\/2540128.2540155"},{"key":"e_1_3_2_1_14_1","volume-title":"Compact CFR. In AAAI Workshop on Computer Poker and Imperfect Information.","author":"Jackson E. G.","year":"2016","unstructured":"Jackson, E. G. 2016. Compact CFR. In AAAI Workshop on Computer Poker and Imperfect Information."},{"key":"e_1_3_2_1_15_1","volume-title":"Measuring the size of large no-limit poker games. Tech. rep","author":"Johanson M.","unstructured":"Johanson, M. 2013. Measuring the size of large no-limit poker games. Tech. rep., University of Alberta."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","unstructured":"Johanson M. Burch N. Valenzano R. and Bowling M. 2013. Evaluating state-space abstractions in extensive-form games. In AAMAS-13.","DOI":"10.5555\/2484920.2484965"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0899-8256(92)90035-Q"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1996.0051"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","unstructured":"Kroer C. and Sandholm T. 2014. Extensive-form game abstraction with bounds. In EC-14. 10.1145\/2600057.2602905","DOI":"10.1145\/2600057.2602905"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","unstructured":"Kroer C. and Sandholm T. 2015. Discretization of continuous action spaces in extensive-form games. In AAMAS-15.","DOI":"10.5555\/2772879.2772889"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","unstructured":"Kroer C. Waugh K. K\u0131l\u0131n\u00e7-Karzan F. and Sandholm T. 2015. Faster first-order methods for extensive-form game solving. In EC-15. 10.1145\/2764468.2764476","DOI":"10.1145\/2764468.2764476"},{"key":"e_1_3_2_1_22_1","unstructured":"Lanctot M. Gibson R. Burch N. Zinkevich M. and Bowling M. 2012. No-regret learning in extensive-form games with imperfect recall. In ICML-12."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","unstructured":"Lipton R. Markakis E. and Mehta A. 2003. Playing large games using simple strategies. In EC-03. 10.1145\/779928.779933","DOI":"10.1145\/779928.779933"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Lisy V. Davis T. and Bowling M. 2016. Counterfactual regret minimization in sequential security games. In AAAI-16.","DOI":"10.1609\/aaai.v30i1.10051"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","unstructured":"Littman M. and Stone P. 2003. A polynomial-time Nash equilibrium algorithm for repeated games. In EC-03. 10.1145\/779928.779935","DOI":"10.1145\/779928.779935"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Sandholm T. 2010. The state of solving large incomplete-information games and application to poker. AI Magazine. Special issue on Algorithmic Game Theory.","DOI":"10.1609\/aimag.v31i4.2311"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.aaa4614"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","unstructured":"Sandholm T. and Singh S. 2012. Lossy stochastic game abstraction with bounds. In EC-12. 10.1145\/2229012.2229079","DOI":"10.1145\/2229012.2229079"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","unstructured":"Waugh K. Morrill D. Bagnell D. and Bowling M. 2015. Solving games with functional regret estimation. In AAAI-15.","DOI":"10.5555\/2886521.2886618"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","unstructured":"Waugh K. Schnizlein D. Bowling M. and Szafron D. 2009a. Abstraction pathologies in extensive games. In AAMAS-09.","DOI":"10.5555\/1558109.1558119"},{"key":"e_1_3_2_1_31_1","unstructured":"Waugh K. Zinkevich M. Johanson M. Kan M. Schnizlein D. and Bowling M. 2009b. A practical use of imperfect recall. In SARA-09."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","unstructured":"Wellman M. P. Reeves D. M. Lochner K. M. Cheng S.-F. and Suri R. 2005. Approximate strategic reasoning through hierarchical reduction of large symmetric games. In AAAI-05.","DOI":"10.5555\/1619410.1619414"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","unstructured":"Zinkevich M. Bowling M. Johanson M. and Piccione C. 2007. Regret minimization in games with incomplete information. In NIPS-07.","DOI":"10.5555\/2981562.2981779"}],"event":{"name":"EC '16: ACM Conference on Economics and Computation","location":"Maastricht The Netherlands","acronym":"EC '16","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 2016 ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2940716.2940736","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2940716.2940736","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2940716.2940736","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:34:38Z","timestamp":1763458478000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2940716.2940736"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,21]]},"references-count":33,"alternative-id":["10.1145\/2940716.2940736","10.1145\/2940716"],"URL":"https:\/\/doi.org\/10.1145\/2940716.2940736","relation":{},"subject":[],"published":{"date-parts":[[2016,7,21]]},"assertion":[{"value":"2016-07-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}