Complexity of pure equilibria in Bayesian games

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 1294-1299

  Gottlob, Georg ^a   Greco, Gianluigi ^b   Mancini, Toni ^c  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF CALABRIA   (Italy)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN GAME; GRAPHICAL GAMES; NORMAL FORM; NP COMPLETE; STRATEGIC GAME;

ARTIFICIAL INTELLIGENCE;

GAME THEORY;

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

References (17)

1. Xi Chen and Xiaotie Deng. Settling the complexity of 2-player Nash-Equilibrium. In Proc. of FOCS 2006. IEEE Comp. Society Press. To appear.
2. V. Conitzer and T. Sandholm. Complexity results about Nash equilibria. In Proc. of IJCAI 2003, pages 765-771. Morgan Kaufmann.
3. K. Daskalakis and C. H. Papadimitriou. Three-player games are hard. Electronic Colloquium on Comp. Complexity, 12, 2005.
4. R. Feldmann, M. Gairing, T. Lücking, B. Monien, and M. Rode. Selfish routing in non-cooperative networks: A survey. In Proc. of MFCS 2003, pages 21-45. Springer.
5. I. Gilboa and E. Zemel. Nash and correlated equilibria: Some complexity considerations. Games and Economic Behavior, 1:80-93, 1989.
6. G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. J. of Comp. and System Sciences, 64(3):579-627, 2002.
7. G. Gottlob, G. Greco, and F. Scarcello. Pure Nash equilibria: hard and easy games. In Proc. of TARK 2003, pages 215-230. ACM Press.
8. J. Harsanyi. Games with incomplete information played by 'bayesian' players, parts i-iii. Management Sci., 14:159-182, 320-334, 486-502, 1968.
9. M. Kearns, M. L. Littman, and S. Singh. Graphical models for Game Theory. In Proc. of UAI 2001, pages 253-260. Morgan Kaufmann.
10. N. Megiddo and C. H. Papadimitriou. On total functions, existence theorems and computational complexity. Theoretical Comp. Science, 81(2):317-324, 1991. (Pubitemid 21668128)
11. R. B. Myerson. Game Theory: Analysis of Conflict. Harvard Univ. Press, 1997.
12. J. F. Nash. Non-cooperative games. Annals of Math., 54(2):286-295, 1951.
13. M. J. Osborne and A. Rubinstein. A Course in Game Theory. The MIT Press, 1994.
14. C. H. Papadimitriou. Computational Complexity. Addison Wesley Publ. Co., 1994.
15. C. H. Papadimitriou. On the complexity of the parity argument and other inefficient proofs of existence. J. of Comp. and System Sciences, 48(3):498-532, 1994.
16. S. Singh, V. Soni, and M. P. Wellman. Computing approximate Bayes-Nash Equilibria in tree-games of incomplete information. In Proc. of ACMEC 2004, pages 81-90. ACM Press.
17. D. Vickrey and D. Koller. Multi-agent algortihms for solving graphical games. In Proc. of AAAI 2002, pages 345-351. AAAI Press/The MIT Press.