Three-player games are hard (2005)
Cached
Download Links
- [eccc.uni-trier.de]
- [www.cs.berkeley.edu]
- [http.cs.berkeley.edu]
- DBLP
Other Repositories/Bibliography
by
Constantinos Daskalakis
,
Christos H. Papadimitriou
| Venue: | Electronic Colloquium on Computational Complexity (ECCC |
| Citations: | 28 - 2 self |
BibTeX
@INPROCEEDINGS{Daskalakis05three-playergames,
author = {Constantinos Daskalakis and Christos H. Papadimitriou},
title = {Three-player games are hard},
booktitle = {Electronic Colloquium on Computational Complexity (ECCC},
year = {2005},
pages = {05--139}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We prove that computing a Nash equilibrium in a 3-player game is PPAD-complete, solving a problem left open in (2).
Citations
| 583 | Non-cooperative games - Nash - 1951 |
| 188 | Graphical Models for Game Theory - Kearns, Littman, et al. - 2001 |
| 159 | Papadimitriou, “The complexity of computing a Nash equilibrium - Daskalakis, Goldberg, et al. - 2006 |
| 126 | On the complexity of the parity argument and other inefficient proofs of existence - Papadimitriou - 1994 |
| 7 | Reducibility Among Equilibrium - Goldberg, Papadimitriou - 2006 |
