Sum-of-Squares meets Nash: Optimal Lower Bounds for Finding any Equilibrium

Electronic Colloquium on Computational Complexity (ECCC), Volume 25, 2018, Pages 126

Cited by: 0|Bibtex|Views14|Links
EI

Abstract:

Several works have shown unconditional hardness (via integrality gaps) of computing equilibria using strong hierarchies of convex relaxations. Such results however only apply to the problem of computing equilibria that optimize a certain objective function and not to the (arguably more fundamental) task of finding emph{any} equilibrium. W...More

Code:

Data:

Your rating :
0

 

Tags
Comments