Pure nash equilibria: Hard and easy games

Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2003

Volumn , Issue , 2003, Pages 215-230

  Gottlob, Georg ^a   Greco, Gianluigi ^b   Scarcello, Francesco ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GAME THEORY; POLYNOMIAL APPROXIMATION;

BOUNDED TREEWIDTH; COMPLEXITY ISSUES; DEPENDENCY STRUCTURES; NASH EQUILIBRIA; PARETO EQUILIBRIA; POLYNOMIAL-TIME; PURE NASH EQUILIBRIUM; UTILITY FUNCTIONS;

CONGESTION CONTROL (COMMUNICATION);

EID: 85017398058     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/846241.846269     Document Type: Conference Paper

References (42)

1. R.J. Aumann, Accetable points in general cooperative n-person games. Contribution to the Theory of Games, Volume IV, Princeton University Press, 1959.
2. R.J. Aumann, What is Game Theory Trying to Accomplish? in Frontiers of Economics, pp. 28-76, Okford: Basil Blackwell, 1985.
3. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. On the Desiderability of Acyclic Database Schemes. Journal of the ACM, 30(3):479-513, 1983.
4. H.L. Bodlaender. Treewidth: Algorithmic Techniques and Results. In Proc. of MFCS'97, Bratislava. LNCS 1295, Springer, pp. 19-36,1997.
5. A. Borodin, S.A. Cook, P.W. Dymond, W.L. Ruzzo and M. Tompa, Two applications of inductive counting for complementation problems, SIAM Journal on Computing, v. 18 n.3, pp.559-578, June 1989.
6. V. Conitzer and T. Sandholm. Complexity Results about Nash Equilibria, to appear in Proc. IJCAI'03.
7. X. Deng, C.H. Papadimitriou, and S. Safra, On the complexity of equilibria, In Proc. of the 34th Annual ACM Symposium on Theory of Computing (STOC 2002), pp. 67-71, ACM, Montrial, Canada, 2002.
8. R.G. Downey and M.R. Fellows, Fixed-Parameter Tractability and Completeness I: Basic Results, SIAM Journal on Computing, 24(4), pp. 873-921, 1995.
9. R. Fagin. Degrees of acyclicity for hypergraphs and relational database schemes. Journal of the ACM, 30(3):514-550,1983.
10. D. Fotakis, S.C. Kontogiannis, E. Koutsoupias, M. Mavronicolas and P.G. Spirakis, The Structure and, Complexity of Nash Equilibria for a Selfish Routing Game, In Proc. of the 29th International Colloquium on Automata, Languages and Programming (ICALP 2002), pp. 123-134, Springer, Malaga, Spain, 2002.
11. M.R. Garey and D.S. Johnson, Computers and Intractability. A Guide to the Theory of NP-completeness, Freeman and Comp., NY, USA, 1979.
12. I. Gilboa and E. Zemel, Nash and correlated equilibria: Some complexity consideration, Games and Economic Behaviour, 1, pp. 80-93, 1989.
13. G. Gottlob, G. Greco, and F. Scarcello. Pure Nash Equilibria: Hard and Easy Games. (Full version.) To appear. Draft in progress available at: www.dbai.tuwien.ac.at/staff/gottlob/purenash.ps
14. G. Gottlob, N. Leone, and F. Scarcello. A Comparison of Structural CSP Decomposition Methods, Artificial Intelligence, 124(2), pp. 243-282,2000.
15. G. Gottlob, N. Leone, F. Scarcello, The complexity of acyclic conjunctive queries, Journal of the ACM, 48(3), pp. 431-498,2001.
16. G. Gottlob, N. Leone, F. Scarcello, Hypertree decompositions and tractable queries, Journal of Computer and System Sciences, 64(3), pp. 579-627,2002.
17. G. Gottlob, N. Leone, F. Scarcello, Computing LOGCFL certificates, Theoretical Computer Science, 270(1-2), pp. 761-777,2002.
18. D.S. Johnson, A Catalog of Complexity Classes, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, pp. 67-161,1990.
19. M. Kearns, M.L. Littman and S. Singh, An Efficient Exact Algorithm for Singly Connected Graphical Games, In Proc. of the Intl. conf. on Neural Information Processing Systems (NIPS01), 2001.
20. M. Kearns, M.L. Littman and S. Singh, Graphical Models for Game Theory,Graphical Models for Game Theory, In Proc. of the International Conference on Uncertainty in AI (UAI01), 2001.
21. M. Kearns and Y. Mansour, Efficient Nash Computation in Large Population Games with Bounded Influence, In Proc. of the International Conference on Uncertainty in AI (UAI02), 2002.
22. M. Kearns and L. Ortiz, Nash Propagation for Loopy Graphical Games, In Proc. of the International conference on Neural Information Processing Systems (NIPS02), 2002.
23. D. Koller and N. Megiddo, The complexity of two-person zero-sum games in extensive form, Games and Economic Behavior, 4, pp. 528-552, 1992.
24. D. Koller and N. Megiddo, Finding mixed strategies with small supports in extensive form games, International Journal of Game Theory, 25, pp. 73-92,1996.
25. D. Koller, N. Megiddo and B. von Stengel, Efficient computation of equilibria for extensive two-person games, Games and Economic Behavior, 14, pp. 220-246,1996.
26. E. Koutsoupias and C.H. Papadimitriou, Worst Case Equilibria, In Proc. of the 16th Symposium on Theoretical Aspects of Computer Science, pp. 404-413,1999.
27. E. Maskin, The Theory of Implementation in Nash Equilibrium, Social Goab and Organization: Essays in memory of Elisha Pazner, pp. 173-204, Cambridge University Press, 1985.
28. R.D. McKelvey and A. McLennan, Computation of equilibria in finite Games, in Handbook of Computational Economics, H. Amman, D. Kendrick and J. Rust eds, pp. 87-142,1996.
29. N. Megiddo and C.H. Papadimitriou, On Total Functions, Existence Theorems, and Computational complexity, Theoretical Computer Science, 81(2), pp. 317-324,1991.
30. D. Monderer and L.S. Shapley, Potential games, Games and Economic Behavior, 1993.
31. J.F. Nash, Non-cooperative Games, Annals of Mathematics, 54(2), pp. 286-295,1951.
32. M.J. Osborne and A. Rubinstein, A Course in Game Theory, MIT Presss, 1994.
33. G. Owen, Game Theory, Academic Press, New York, 1982.
34. C.H. Papadimitriou and M. Yannakakis, On the Complexity as Bounded Rationality, In Proc. of the 26th Annual ACM Symposium on Theory of Computing, pp. 726-733,1994.
35. C.H. Papadimitriou, On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence, Journal of Computer and system Sciences, 48(3), pp. 498-532,1994.
36. C.H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, Mass, 1994.
37. C.H. Papadimitriou, Algorithms, Games, and the Internet, In Proc. of the 28th International Colloqium on Automata, Languages and Programming, pp. 1-3, 2001.
38. N. Robertson and P.D. Seymour, Graph Minors II. Algorithmic aspects of tree width, Journal of Algorithms, 1, pp. 309-322,1986.
39. R. Rosenthal, A Class of Games possessing pure-strategy Nash equilibria, International Journal of Game Theory, 2, pp. 65-67,1973.
40. M.Y. Vardi, Constraint Satisfaction and Database Theory: a Tutorial, In Proc. of the 19-th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 76-85, Dallas, Texas, USA, 2000.
41. H. Venkateswaran, Properties that characterize LOGCFL, Journal of Computer and System Sciences, v.43 n.2, pp.380-404,1991.
42. D. Vickrey and D. Koller. Multi-Agent Algortihms for Solving Graphical Games. In Proc. of the 18th National Conference on Artificial Intelligence, pp.345-351, Edmonton, Alberta, Canada, 2002.