A continuation method for nash equilibria in structured games

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 757-764

  Blum, Ben ^a   Shelton, Christian R ^a   Koller, Daphne ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE ALGORITHMS; ARBITRARY TOPOLOGY; CONTINUATION METHOD; EXACT ALGORITHMS; EXTENSIVE-FORM GAMES; FAST COMPUTATION; INFLUENCE DIAGRAM; NASH EQUILIBRIA;

ALGORITHMS; ARTIFICIAL INTELLIGENCE;

COMPUTER GAMES;

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

References (19)

1. S. Govindan and R. Wilson. Structure theorems for game trees. Proc. Natl Academy of Sciences, 99(13):9077-9080, 2002. (Pubitemid 34693686)
2. S. Govindan and R. Wilson. Computing Nash equilibria by iterated polymatrix approximation. J. Economic Dynamics and Control, 2003. to appear.
3. S. Govindan and R. Wilson. A global Newton method to compute Nash equilibria. / Economic Theory, 2003. to appear.
4. R. A. Howard and J. E. Matheson. Influence diagrams. In Readings on the Principles and Applications of Decision Analysis, volume 2, pages 719-762. Strategic Decision Group, 1984. article dated 1981.
5. M. Kearns, M. L. Littman, and S. Singh. Graphical models for game theory. In Proc. UAI, 2001.
6. E. Kohlberg and J.-F. Mertens. On the strategic stability of equilibria. Econometrica, 54(5): 1003-1038, September 1986.
7. D. Koller and N. Megiddo. The conv plexity of two-person zero-sum games in extensive form. Games and Economic Bahavior, 4:528-552, 1992.
8. J D. Kollcr and B. Milch. Multi-agent influence diagrams for representing and solving games. In Proc. IJCAI, pages 1027-1034, 2001.
9. P. La Mura. Game networks. In Proc. UAI, pages 335-342, 2000.
10. S. L. Lauritzen and D. J. Spiegelha Iter. Local computations with probabilities on graphical structures and their application to expert systems. J Royal Statistical Society, B 50(2): 157-224, 1998.
11. C. E. Lemke and J. T. Howson, Jr. Equilibrium points in bimatrix games. J. Society of Applied Mathematics, 12(2):413-423, June 1964.
12. M. L. Littman, M. Kearns, and S. Singh. An efficient exact algorithm for singly connected graphical games. In NIPS-14, volume 2, pages 817-823, 2002.
13. R. D. McKelvey and A. McLennan. Computation of equilibria in finite games. In Handbook of Computational Economics, vol. 1, pages 87-142. Elsevier, 1996.
14. J. Nash. Non-cooperative games. The Annals of Mathematics, 52(2):286-295, September 1951.
15. L. E. Ortiz and M. Kearns. Nash propagation for loopy graphical games. In NIPS-15, 2003. to appear.
16. G. Owen. Game Theory. Academic Press, UK, 1995.
17. D. Vickrey and D. Koller. Multi-agent algorithms for solving graphical games. In Proc. AAAI, 2002.
18. B. von Stengel. Efficient computation of behavior strategies. Games and Economic Behavior, 14, 1996.
19. L. T. Watson. Theory of globally convergent probability-one homotopies for nonlinear programming. SIAM J. on Optimization, II(3):761-780, 2000.