论文信息 - Simple complexity from imitation games

Simple complexity from imitation games

We give simple proofs of refinements of the complexity results of Gilboa and Zemel (1989), and we derive additional results of this sort. Our constructions employ imitation games, which are two person games in which both players have the same sets of pure strategies and the second player wishes to play the same pure strategy as the first player.

Andrew McLennan | Rabee Tourky | R. Tourky | A. McLennan

[1] T. Motzkin,et al. Maxima for Graphs and a New Proof of a Theorem of Turán , 1965, Canadian Journal of Mathematics.

[2] Christos H. Papadimitriou,et al. On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence , 1994, J. Comput. Syst. Sci..

[3] Immanuel M. Bomze,et al. On Standard Quadratic Optimization Problems , 1998, J. Glob. Optim..

[4] Christos H. Papadimitriou,et al. Algorithms, Games, and the Internet , 2001, ICALP.

[5] Vincent Conitzer,et al. Complexity Results about Nash Equilibria , 2002, IJCAI.

[6] R. Tourky,et al. From Imitation Games to Kakutani , 2005 .

[7] J. Harsanyi. Oddness of the number of equilibrium points: A new proof , 1973 .

[8] Bruno Codenotti,et al. On the computational complexity of Nash equilibria for (0, 1) bimatrix games , 2005, Inf. Process. Lett..

[9] Eitan Zemel,et al. Nash and correlated equilibria: Some complexity considerations , 1989 .

[10] Christos H. Papadimitriou,et al. On Total Functions, Existence Theorems and Computational Complexity , 1991, Theor. Comput. Sci..

[11] Vincent Conitzer,et al. New complexity results about Nash equilibria , 2008, Games Econ. Behav..