Nash Propagation for Loopy Graphical Games

NIPS 2002: Proceedings of the 15th International Conference on Neural Information Processing Systems

Volumn , Issue , 2002, Pages 793-800

  Ortiz, Luis E ^a   Kearns, Michael ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BACKPROPAGATION; COMPUTER GAMES; ITERATIVE METHODS; TREES (MATHEMATICS); UNDIRECTED GRAPHS;

BELIEF PROPAGATION; EXPERIMENTAL EVIDENCE; FORMAL ANALYSIS; GRAPHICAL GAMES; MESSAGE-PASSING ALGORITHM; MULTIPLAYER GAMES; NASH EQUILIBRIA; PROBABILISTIC INFERENCE; TREE ALGORITHMS; UNDIRECTED GRAPH;

BELIEF PROPAGATION;

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

References (6)

1. M. Kearns, M. Littman, and S. Singh. Graphical models for game theory. In Proceedings of the Conference on Uncertainty in Artificial Intelligence, pages 253-260, 2001.
2. S. Lauritzen and D. Spiegelhalter. Local computations with probabilities on graphical structures and their application to expert systems. J. Royal Stat. Soc. B, 50(2):157-224, 1988.
3. J. F. Nash. Non-cooperative games. Annals of Mathematics, 54:286-295, 1951.
4. J. Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, 1988.
5. D. Vickrey and D. Koller. Multi-agent algorithms for solving graphical games. In Proceedings of the National Conference on Artificial Intelligence (AAAI), 2002. To appear.
6. Yair Weiss. Correctness of local probability propagation in graphical models with loops. Neural Computation, 12(1):1-41, 2000.