Approximating maxmin strategies in imperfect recall games using A-loss recall property

Lisý, 2016, Counterfactual regret minimization in sequential security games Christodoulou, 2008, Bayesian combinatorial auctions, Autom. Lang. Program., 820 Sandholm, 2015, Steering evolution strategically: computational game theory and opponent exploitation for treatment planning, drug design, and synthetic biology, 4057 Bošanský, 2016, Algorithms for computing strategies in two-player simultaneous move games, Artif. Intell., 237, 1, 10.1016/j.artint.2016.03.005 Moravčík, 2017, DeepStack: expert-level artificial intelligence in heads-up no-limit poker, Science, 356, 508, 10.1126/science.aam6960 Fang, 2017, PAWS—a deployed game-theoretic application to combat poaching, AI Mag., 38, 23 von Stengel, 1996, Efficient computation of behavior strategies, Games Econ. Behav., 14, 220, 10.1006/game.1996.0050 Zinkevich, 2007, Regret minimization in games with incomplete information, 1729 Hoda, 2010, Smoothing techniques for computing Nash equilibria of sequential games, Math. Oper. Res., 35, 494, 10.1287/moor.1100.0452 Gilpin, 2007, Potential-aware automated abstraction of sequential games, and holistic equilibrium analysis of Texas Hold'em poker, vol. 22, 50 Gilpin, 2007, Lossless abstraction of imperfect information games, J. ACM, 54, 25, 10.1145/1284320.1284324 Kroer, 2014, Extensive-form game abstraction with bounds, 621 Brown, 2015, Simultaneous abstraction and equilibrium finding in games Wichardt, 2008, Existence of Nash equilibria in finite extensive form games with imperfect recall: a counterexample, Games Econ. Behav., 63, 366, 10.1016/j.geb.2007.08.007 Koller, 1992, The complexity of two-person zero-sum games in extensive form, Games Econ. Behav., 4, 528, 10.1016/0899-8256(92)90035-Q Hansen, 2007, Finding equilibria in games of no chance, 274 Kroer, 2016, Imperfect-recall abstractions with bounds in games, 459 Lanctot, 2012, No-regret learning in extensive-form games with imperfect recall, 65 Bošanský, 2015, Combining compact representation and incremental generation in large games with sequential strategies, 812 Kaneko, 1995, Behavior strategies, mixed strategies and perfect recall, Int. J. Game Theory, 24, 127, 10.1007/BF01240038 Kline, 2002, Minimum memory for equivalence between ex ante optimality and time-consistency, Games Econ. Behav., 38, 278, 10.1006/game.2001.0888 Čermák, 2017, Towards solving imperfect recall games Bosansky, 2017, Computing maxmin strategies in extensive-form zero-sum games with imperfect recall Koller, 1996, Efficient computation of equilibria for extensive two-person games, Games Econ. Behav., 14, 247, 10.1006/game.1996.0051 Kolodziej, 2013, Global optimization of bilinear programs with a multiparametric disaggregation technique, J. Glob. Optim., 57, 1039, 10.1007/s10898-012-0022-1 Čermák, 2017, Combining incremental strategy generation and branch and bound search for computing maxmin strategies in imperfect recall games Bosansky, 2014, An exact double-oracle algorithm for zero-sum extensive-form games with imperfect information, J. Artif. Intell. Res., 829, 10.1613/jair.4477 Kuhn, 2016, Extensive games and the problem of information, 193 Piccione, 1997, On the interpretation of decision problems with imperfect recall, Games Econ. Behav., 20, 3, 10.1006/game.1997.0536 Nash, 1950, Equilibrium points in n-person games, Proc. Natl. Acad. Sci., 36, 48, 10.1073/pnas.36.1.48 Garey, 1976, Some NP-complete geometric problems, 10 Etessami, 2010, On the complexity of nash equilibria and other fixed points, SIAM J. Comput., 39, 2531, 10.1137/080720826 Bošanský, 2016, Algorithms for computing strategies in two-player simultaneous move games, Artif. Intell., 237, 1, 10.1016/j.artint.2016.03.005 McMahan, 2003, Planning in the presence of cost functions controlled by an adversary, 536 Gordon, 2006, No-regret algorithms for online convex programs, 489 Lanctot, 2013