A polynomial-time algorithm for action-graph games

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2006, Pages 679-684

  Jiang, Albert Xin ^a   Leyton Brown, Kevin ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ACTION-GRAPH GAMES (AGG); ANONYMITY STRUCTURES; POLYNOMIAL-TIME ALGORITHMS; UTILITY FUNCTIONS;

ALGORITHMS; COMPUTATION THEORY; FUNCTIONS; POLYNOMIAL APPROXIMATION;

GAME THEORY;

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

References (12)

1. Bhat, N., and Leyton-Brown, K. 2004. Computing Nash equilibria of action-graph games. In UAI.
2. Blum, B.; Shelton, C.; and Koller, D. 2002. Gametracer. http://dags.stanford.edu/Games/gametracer.html.
3. Fredkin, E. 1962. Trie memory. Comm. ACM 3:490-499.
4. Govindan, S., and Wilson, R. 2003. A global Newton method to compute Nash equilibria. Journal of Economic Theory 110:65-86.
5. Govindan, S., and Wilson, R. 2004. Computing Nash equilibria by iterated polymatrix approximation. Journal of Economic Dynamics and Control 28:1229-1241.
6. Kearns, M.; Littman, M.; and Singh, S. 2001. Graphical models for game theory. In UAI.
7. Koller, D., and Milch, B. 2001. Multi-agent influence diagrams for representing and solving games. In IJCAI.
8. LaMura, P. 2000. Game networks. In UAI.
9. Leyton-Brown, K., and Tennenholtz, M. 2003. Local-effect games. In IJCAI.
10. Papadimitriou, C. 2005. Computing correlated equilibria in multiplayer games. In STOC. Available at http://www.cs.berkeley.edu/~christos/papers/cor.ps.
11. Rosenthal, R. 1973. A class of games possessing pure-strategy Nash equilibria. Int. J. Game Theory 2:65-67.
12. van der Laan, G.; Talman, A.; and van der Heyden, L. 1987. Simplicial variable dimension algorithms for solving the nonlinear complementarity problem on a product of unit simplices using a general labelling. Mathematics of OR 12(3):377-397.