Practical performance of refinements of nash equilibria in extensive-form zero-sum games

Frontiers in Artificial Intelligence and Applications

Volumn 263, Issue , 2014, Pages 201-206

  Čermák, Jiří ^a   Bošanský, Branislav ^a   Lisý, Viliam ^a  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

INTELLIGENT SYSTEMS;

EQUILIBRIA STRATEGIES; EQUILIBRIUM REFINEMENTS; EXPERIMENTAL ANALYSIS; EXTENSIVE-FORM GAMES; NASH EQUILIBRIA; NASH EQUILIBRIUM STRATEGIES; PERFORMANCE; SOLUTION CONCEPTS; ZERO SUMS; ZERO-SUM GAME;

GAME THEORY;

EID: 84923203461     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-61499-419-0-201     Document Type: Conference Paper

References (19)

1. Peter I Cowling, Edward J Powley, and Daniel Whitehouse, 'Information set monte carlo tree search', Computational Intelligence and AI in Games, IEEE Transactions on, 4, 120-143, (2012).
2. Sam Ganzfried and Tuomas Sandholm, 'Improving performance in imperfect-information games with large state and action spaces by solving endgames', in Computer Poker and Imperfect Information Workshop at the National Conference on Artificial Intelligence (AAAI), (2013).
3. Levente Kocsis, Csaba Szepesvári, and Jan Willemson, 'Improved Monte-Carlo Search', (2006).
4. Daphne Koller, Nimrod Megiddo, and Berhard von Stengel, 'Fast algorithms for finding randomized strategies in game trees', Proceedings of the 26th annual ACM symposium on Theory of computing, (1994).
5. David M. Kreps and RobertWilson, 'Sequential equilibria', Econometrica, (1982).
6. Harold W. Kuhn, 'Extensive games and the problem of information', Annals of Mathematics Studies, (1953).
7. Richard D McKelvey, Andrew M McLennan, and Theodore L Turocy, 'Gambit: Software tools for game theory', (2010).
8. Richard D McKelvey and Thomas R Palfrey, 'Quantal response equilibria for normal form games', Games and economic behavior, 10(1), 6-38, (1995).
9. Peter Bro Miltersen and Troels Bjerre Sørensen, 'Computing a quasiperfect equilibrium of a two-player game', Economic Theory, (2008).
10. Peter Bro Miltersen and Troels Bjerre Sørensen, 'Fast algorithms for finding proper strategies in game trees', In proceedings of 19th Annual ACM-SIAM Symposium on Discrete Algorithms, 874-883, (2008).
11. Roger B. Myerson, 'Refinements of the nash equilibrium concept', Game Theory, 7, 73-80, (1978).
12. Tuomas Sandholm, 'The State of Solving Large Incomplete-Information Games, and Application to Poker ', AI Magazine, 13-32, (Winter 2010).
13. Reinhard Selten, 'Reexamination of the perfectness concept for equilibrium points in extensive games', International Journal of Game Theory, 4, 25-55, (1975).
14. S. J. J. Smith and D. S. Nau, 'An analysis of forward pruning', in Proceedings of the National Conference on Artificial Intelligence, pp. 1386-1386, (1995).
15. Milind Tambe, Security and Game Theory: Algorithms, Deployed Systems, Lessons Learned, Cambridge University Press, 2011.
16. Eric van Damme, 'A relation between perfect equilibria in extensive form games and proper equilibria in normal form games', Game Theory, 13, 1-13, (1984).
17. Eric van Damme, Stability and Perfection of Nash Equilibria, Springer-Verlag, 1991.
18. Michael P. Wellman, Trading Agents, Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool Pub. , 2011.
19. Martin Zinkevich, Michael Bowling, and Neil Burch, 'A new algorithm for generating equilibria in massive zero-sum games', In Proceednigs of the 22nd National Conference on Artificial Intelligence, (2007).