@inproceedings{Daskalakis:2006:CCN:1132516.1132527,
Address = {New York, NY, USA},
Author = {Daskalakis, Constantinos and Goldberg, Paul W. and Papadimitriou, Christos H.},
BookTitle = {Proceedings of the Thirty-eighth Annual ACM Symposium on Theory of Computing},
File = {simplified (0) - a - a - t.pdf},
ISBN = {1-59593-134-1},
Keywords = {Nash equilibrium, PPAD-completeness, complexity, game theory},
Location = {Seattle, WA, USA},
Pages = {71--78},
Publisher = {ACM},
Series = {STOC '06},
Title = {The Complexity of Computing a Nash Equilibrium},
URL = {http://doi.acm.org/10.1145/1132516.1132527},
Year = {2006},
acmid = {1132527},
bdsk-url-1 = {http://doi.acm.org/10.1145/1132516.1132527},
bdsk-url-2 = {https://doi.org/10.1145/1132516.1132527},
date-added = {2018-05-30 08:34:07 +0000},
date-modified = {2018-05-30 08:34:07 +0000},
file-2 = {p71-daskalakis (0) - a - a - t.pdf},
numpages = {8},
doi = {10.1145/1132516.1132527}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A