Temporal action-graph games: A new representation for dynamic games

Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009

Volumn , Issue , 2009, Pages 268-276

  Jiang, Albert Xin ^a   Leyton Brown, Kevin ^a   Pfeffer, Avi ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b CHARLES RIVER ANALYTICS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; SIGNAL ENCODING;

DIRECT ENCODING; DYNAMIC GAME; EXTENSIVE-FORM GAMES; GRAPHICAL REPRESENTATIONS; IMPERFECT INFORMATION; INFLUENCE DIAGRAM; STATE OF THE ART; TEMPORAL ACTION GRAPHS;

ENCODING (SYMBOLS);

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

References (21)

1. N. Bhat and K. Leyton-Brown. Computing Nash equilibria of Action-Graph Games. In UAI, 2004.
2. B. Blum, C. Shelton, and D. Koller. A continuation method for Nash equilibria in structured games. In IJCAI, 2003.
3. C. Boutilier, N. Friedman, M. Goldszmidt, and D. Koller. Context-specific independence in Bayesian networks. In UAI, pages 115-123, 1996.
4. A. Darwiche. Constant-space reasoning in dynamic Bayesian networks. International Journal of Approximate Reasoning, 26(3):161-178, 2001. (Pubitemid 32372136)
5. D. Fudenberg and J. Tirole. Game Theory. MIT Press, 1991.
6. S. Govindan and R. Wilson. Structure theorems for game trees. Proceedings of the National Academy of Sciences, 99(13):9077-9080, 2002. (Pubitemid 34693686)
7. D. Heckerman and J.S. Breese. Causal independence for probability assessment and inference using Bayesian networks. IEEE Transactions on Systems, Man and Cybernetics, Part A, 26(6):826-831, 1996. (Pubitemid 126782451)
8. A. X. Jiang and K. Leyton-Brown. A polynomial-time algorithm for Action-Graph Games. In AAAI, 2006.
9. A.X. Jiang, K. Leyton-Brown, and N. Bhat. Action-graph games. Technical Report TR-2008-13, University of British Columbia, 2008.
10. M.J. Kearns, M.L. Littman, and S.P. Singh. Graphical models for game theory. In UAI, 2001.
11. D. Koller and B. Milch. Multi-agent influence diagrams for representing and solving games. Games and Economic Behavior, 45(1):181-221, 2003. (Pubitemid 37194965)
12. H. Kuhn. Extensive games and the problem of information. In Harold Kuhn and Arthur Tucker, editors, Contributions to the Theory of Games, volume II, pages 193-216, 1953.
13. P. La Mura. Game networks. In UAI, 2000.
14. K. Leyton-Brown and M. Tennenholtz. Local-effect games. In IJCAI, 2003.
15. B. Milch and D. Koller. Ignorable information in multiagent scenarios. Technical Report MIT-CSAIL-TR-2008-029, MIT, 2008.
16. K. Murphy. Bayes Net Toolbox for Matlab. http://bnt.sourceforge.net, 2007.
17. D. Nilsson and S.L. Lauritzen. Evaluating influence diagrams using LIMIDs. In UAI, pages 436-445, 2000.
18. A. Pfeffer. Probabilistic reasoning for complex systems. PhD thesis, Computer Science Department, Stanford University, 2000.
19. D. Poole and N.L. Zhang. Exploiting contextual independence in probabilistic inference. Journal of Artificial Intelligence Research, 18:263-313, 2003. (Pubitemid 41525938)
20. R.W. Rosenthal. A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory, 2:65-67, 1973.
21. David R.M. Thompson and Kevin Leyton-Brown. Computational analysis of perfect-information position auctions. In ACM-EC, 2009.