ACM Symposium on Discrete Algorithms, SODA 2015


Article Details
Title: Approximating the best Nash Equilibrium in no(log n)-time breaks the Exponential Time Hypothesis
Article URLs:
Alternative Article URLs:
Authors: Mark Braverman
  • Princeton University, Department of Computer Science
Young Kun-Ko
  • Princeton University, Department of Computer Science
Omri Weinstein
  • Princeton University, Department of Computer Science
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1215990, 1149888
DBLP Key: conf/soda/BravermanKW15
Author Comments:

Discuss this paper and its artifacts below