The complexity of computing a Nash equilibrium

Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou. The complexity of computing a Nash equilibrium. In Jon M. Kleinberg, editor, Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006. pages 71-78, ACM, 2006. [doi]

@inproceedings{DaskalakisGP06,
  title = {The complexity of computing a Nash equilibrium},
  author = {Constantinos Daskalakis and Paul W. Goldberg and Christos H. Papadimitriou},
  year = {2006},
  doi = {10.1145/1132516.1132527},
  url = {http://doi.acm.org/10.1145/1132516.1132527},
  researchr = {https://researchr.org/publication/DaskalakisGP06},
  cites = {0},
  citedby = {0},
  pages = {71-78},
  booktitle = {Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006},
  editor = {Jon M. Kleinberg},
  publisher = {ACM},
  isbn = {1-59593-134-1},
}