Fast algorithms for finding proper strategies in game trees

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 874-883

  Miltersen, Peter Bro ^a   Sørensen, Troels Bjerre ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

GAME THEORY; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

FAST ALGORITHMS; FINITE SEQUENCES; GAME TREES; IMPERFECT INFORMATION; INFORMATION GAMES; NORMAL FORM (NF); POLYNOMIAL-TIME;

ALGORITHMS;

EID: 44449150883     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Darse Billings, Neil Burch, Aaron Davidson, Robert Holte, Jonathan Schaeffer, Terence Schauenberg, and Duane Szafron. Approximating game-theoretic optimal strategies for full-scale poker. In International Joint Conference on Artificial Intelligence, pages 661-668, 2003.
2. Lawrence Blume, Adam Brandenburger, Eddie Dekel. Lexicographic probabilities and equilibrium refinements. Econometrica, 59:81-98, 1991.
3. Xi Chen and Xiaotie Deng. Settling the complexity of two-player Nash equilibrium. In Proceedings of 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pages 261-272, 2006.
4. Eric van Damme. A relation between perfect equilibria in extensive form games and proper equilibria in normal form games. International Journal of Game Theory, 13:1-13, 1984.
5. Eric van Damme. Stability and Perfection of Nash Equilibria. Springer-Verlag, 2nd edition, 1991.
6. Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou. The complexity of computing a Nash equilibrium. In Procedings of the 38th Annual ACM Symposium on the Theory of Computing (STOC'06), pages 71-78, 2006.
7. Melvin Dresher. The Mathematics of Games of Strategy: Theory and Applications. Prentice-Hall, 1961.
8. Andrew Gilpin and Tuomas Sandholm. Lossless abstraction of imperfect information games. Journal of the ACM, 54(5), 2007.
9. Elon Kohlberg and Jean-Francois Mertens. On the strategic stability of equilibria. Econometrica, 54:1003-1037, 1986.
10. Daphne Roller, Nimrod Megiddo, and Bernhard von Stengel. Fast algorithms for finding randomized strategies in game trees. In Proceedings of the 26th Annual ACM Symposium on the Theory of Computing (STOC'94), pages 750-759, 1994.
11. Daphne Roller and Avi Pfeffer. Representations and solutions for game-theoretic problems. Artificial Intelligence, 94(1-2):167-215, 1997.
12. David M. Rreps and Robert Wilson. Sequential equilibria. Econometrica, 50(4):863-894, July 1982.
13. H.W. Ruhn. Extensive games and the problem of information. Annals of Matematical Studies, 28:193-216, 1953.
14. Richard D. McRelvey, Andrew M. McLennan, and Theodore L. Turocy. Gambit: Software tools for game theory, version 0.97.0.7. http://econweb.tamu.edu/ gambit, 2004.
15. Peter Bro Miltersen and Troels Bjerre Sørensen. Computing proper equilibria of zero-sum games. In Proceedings of the fifth International Conference on Computers and Games, May 2006.
16. Peter Bro Miltersen and Troels Bjerre Sørensen. Computing sequential equilibria for two-player games. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '06), pages 107-116, 2006.
17. Peter Bro Miltersen and Troels Bjerre Sørensen. Computing a quasi-perfect equilibrium of a two-player game. Economic Theory, to appear, 2008.
18. R. B. Myerson. Refinements of the Nash equilibrium concept. International Journal of Game Theory, 15:133-154, 1978.
19. Bernhard von Stengel. Efficient computation of behavior strategies. Gaines and Economic Behavior, 14:220-246, 1996.
20. Yoshitsugu Yamamoto. A path-following procedure to find a proper equilibrium of finite games. International Journal of Game Theory, 22:249-259, 1993.