IEEE Foundations of Computer Science, FOCS 2016


Article Details
Title: Settling the Complexity of Computing Approximate Two-Player Nash Equilibria
Article URLs:
Alternative Article URLs:
Authors: Aviad Rubinstein
  • University of California at Berkeley
Sharing: Unknown
Verification: Author has not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1408635
DBLP Key: conf/focs/Rubinstein16
Author Comments:

Discuss this paper and its artifacts below