Iterative algorithm for solving two-player zero-sum extensive-form games with imperfect information

Frontiers in Artificial Intelligence and Applications

Volumn 242, Issue , 2012, Pages 193-198

  Bošanský, Branislav ^a   Kiekintveld, Christopher ^b   Lisý, Viliam ^a   Pěchouček, Michal ^a  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

^b 500 W University Avenue   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

ALGORITHM FOR SOLVING; ALGORITHMIC FRAMEWORK; BEST RESPONSE; EXACT ALGORITHMS; EXTENSIVE-FORM GAMES; GAME WITH IMPERFECT INFORMATION; ITERATIVE ALGORITHM; NASH EQUILIBRIA; RESPONSE ALGORITHMS; ZERO SUMS;

ITERATIVE METHODS;

EID: 84878789913     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-61499-098-7-193     Document Type: Conference Paper

References (14)

1. C. Barnhart, E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, and P. H. Vance, 'Branch-and-price: Column generation for solving huge integer programs', Operations Research, (1998).
2. P. Ciancarini and G. P. Favini, 'Monte Carlo tree search in Kriegspiel', Artificial Intelligence, (2010).
3. A. Gilpin, J. Pena, and T Sandholm, 'First-Order Algorithm with O(ln(1/epsilon)) Convergence for epsilon-Equilibrium in Two-Person Zero-Sum Games.', Mathematical Programming, (2011).
4. E. Halvorson, V. Conitzer, and R. Parr, 'Multi-step Multi-sensor Hider-Seeker Games', in Proc. of IJCAI, (2009).
5. M. Jain, D. Korzhyk, O. Vanek, V. Conitzer, M. Tambe, and M. Pechoucek, 'Double Oracle Algorithm for Zero-Sum Security Games on Graph', in Proc. of AAMAS, (2011).
6. D. Koller, N. Megiddo, and B. von Stengel, 'Efficient computation of equilibria for extensive two-person games', Games and Economic Behavior, (1996).
7. M. Lanctot, K. Waugh, M. Zinkevich, and M. Bowling, 'Monte carlo sampling for regret minimization in extensive games', in Proc. of NIPS, (2009).
8. H. B. McMahan and G. J. Gordon, 'A fast bundle-based anytime algorithm for poker and other convex games', Journal of Machine Learning Research, (2007).
9. H. B. McMahan, G. J. Gordon, and A. Blum, 'Planning in the presence of cost functions controlled by an adversary', in ICML, (2003).
10. N. A. Risk and D. Szafron, 'Using Counterfactual Regret Minimization to Create Competitive Multiplayer Poker Agents', in Proc of AAMAS, (2010).
11. Y. Shoham and K. Leyton-Brown, Multiagent Systems: Algorithm, Game-Theoretic, and Logical Foundations, Cambridge University Press, 2009.
12. J. Tsai, S. Rathi, C. Kiekintveld, F. Ordóñez, and M. Tambe, 'IRIS - A Tool for Strategic Security Allocation in Transportation Networks Categories and Subject Descriptors', in Proc. of AAMAS, (2009).
13. O. Vanek, B. Bosansky, M. Jakob, V. Lisy, and M. Pechoucek, 'Extending security games to defenders with constrained mobility', in Proc. of AAAI Spring Symposium GTSSH, (2012).
14. B. von Stengel, 'Efficient computation of behavior strategies', Games and Economic Behavior, (1996).