Computing approximate Bayes-Nash equilibria in tree-games of incomplete information

Proceedings of the ACM Conference on Electronic Commerce

Volumn 5, Issue , 2004, Pages 81-90

  Singh, Satinder ^a   Soni, Vishal ^a   Wellman, Michael P ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Approximate Bayes Nash Equilibria; Games of Incomplete Information; Structured Games

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ARTIFICIAL INTELLIGENCE; GAME THEORY; INFORMATION THEORY; POLYNOMIALS; TREES (MATHEMATICS);

APPROXIMATE BAYES-NASH EQUILIBRIA; GAMES OF INCOMPLETE INFORMATION; STRUCTURED GAMES;

COMPUTATIONAL METHODS;

EID: 3242795032     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/988772.988785     Document Type: Conference Paper

References (14)

1. S. Athey. Single crossing properties and the existence of pure strategy equilibria in games of incomplete information. Econometrica, 69:861-869, 2001.
2. V. Conitzer and T. Sandholm. Complexity results about Nash equilibria. In Eighteenth International Joint Conference on Artificial Intelligence, pages 765-771, Acapulco, 2003.
3. D. Fudenberg and J. Tirole. Game Theory. MIT Press, 1991.
4. J. Harsanyi. Games of incomplete information played by Bayesian players. Management Science, 14:159-182, 320-334, 486-502, 1967.
5. S. Kakade, M. Kearns, J. Langford, and L. Ortiz. Correlated equilibria in graphical games. In Fourth ACM Conference on Electronic Commerce, pages 42-47, San Diego, 2003.
6. M. Kearns, M. L. Littman, and S. Singh. Graphical models for game theory. In Seventeenth Conference on Uncertainty in Artificial Intelligence, pages 253-260, Seattle, 2001.
7. K. Leyton-Brown and M. Tennenholtz. Local-effect games. In Eighteenth International Joint Conference on Artificial Intelligence, pages 772-777, Acapulco, 2003.
8. M. L. Littman, M. Kearns, and S. Singh. An efficient, exact algorithm for solving tree-structured graphical games. In Advances in Neural Information Processing Systems 14, pages 817-823, 2001.
9. P. Milgrom and C. Shannon. Monotone comparative statics. Econometrica, 62:157-180, 1994.
10. P. Milgrom and R. Weber. Distributional strategies for games with incomplete information. Mathematics of Operations Research, 10:619-632, 1985.
11. J. F. Nash. Non cooperative games. Annals of Mathematics, 54:286-295, 1951.
12. L. E. Ortiz and M. Kearns. Nash propagation for loopy graphical games. In S. T. S. Becker and K. Obermayer, editors, Advances in Neural Information Processing Systems 15, pages 793-800. MIT Press, Cambridge, MA, 2003.
13. D. M. Topkis. Supermodularity and Complementarity. Princeton University Press, 2002.
14. D. Vickrey and D. Koller. Multi-agent algorithms for solving graphical games. In Eighteenth National Conference on Artificial Intelligence, pages 345-351, Edmonton, 2002.