Reducibility Among Equilibrium Problems (2005)
by
Paul W. Goldberg
,
Christos H. Papadimitriou
| Venue: | ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY |
| Citations: | 35 - 1 self |
BibTeX
@MISC{Goldberg05reducibilityamong,
author = {Paul W. Goldberg and Christos H. Papadimitriou},
title = { Reducibility Among Equilibrium Problems},
year = {2005}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We address the fundamental question of whether the Nash equilibria of a game can be computed in polynomial time. We describe certain efficient reductions between this problem for normal form games with a fixed number of players and graphical games with fixed degree. Our main result is that the problem of solving a game for any constant number of players, is reducible to solving a 4-player game.
Citations
| 583 | Non-cooperative games - Nash - 1951 |
| 188 | Graphical Models for Game Theory - Kearns, Littman, et al. - 2001 |
| 126 | On the complexity of the parity argument and other inefficient proofs of existence - Papadimitriou - 1994 |
| 115 | Complexity Results about Nash Equilibria - Conitzer, Sandholm |
| 114 | The complexity of pure nash equilibria - Fabrikant, Papadimitriou, et al. - 2004 |
| 104 | Nash and Correlated equilibria: Some Complexity Considerations - Gilboa, Zemel - 1989 |
| 22 | Nash equilibria via polynomial equations, in - Lipton, Markakis |
| 7 | Computing Correlated Equilibria - Papadimitriou - 2005 |
| 6 | Papadimitriou \On the Complexity of the Parity Argument and other Inefcient Proofs of Existence - H - 1994 |
| 5 | Algebraic methods in game theory - Datta - 2003 |
| 3 | An Efficient Exact Algorithm for Single Connected Graphical Games - Littman, Kearns, et al. - 2002 |
| 2 | Pure Nash Equilibria: Hard and Easy - Gottlob, Greco, et al. - 2003 |
