Sum-of-Squares meets nash: Lower bounds for finding any equilibrium

Keyphrases

• Sum of Squares 100%
• Approximate Equilibrium 100%
• Oracle 66%
• MaxCut 33%
• Motivation 33%
• Approximation Algorithms 33%
• Combinatorial Optimization 33%
• Quality Measures 33%
• Nash Equilibrium 33%
• Social Welfare 33%
• Partial Solutions 33%
• Algorithm Framework 33%
• Semidefinite Programming 33%
• List Length 33%
• Two-player Games 33%
• Unsupervised Machine Learning 33%
• Bimatrix Game 33%
• Algorithmic Game Theory 33%
• Exact Equilibria 33%
• Unique Games 33%
• Proof Strategy 33%
• Convex Relaxation 33%
• Enumerative Algorithms 33%
• Constraint Satisfaction Problem 33%
• Approximate Nash Equilibrium 33%
• Separable States 33%
• Small-set Expansion 33%
• Natural Quality 33%
• Sum-of-squares Method 33%
• Exponential Time Hypothesis 33%

Computer Science

• Nash Equilibrium 100%
• Machine Learning 50%
• Approximation Algorithms 50%
• And-States 50%
• Square Solution 50%
• Combinatorial Optimisation 50%
• Quality Measure 50%
• Constraint Satisfaction Problems 50%
• Semidefinite Programming 50%
• Convex Relaxation 50%
• Candidate Partial Solution 50%

Mathematics

• Sum of Squares 100%
• Approximates 100%
• Nash Equilibrium 33%
• Rounding 33%
• Max-Cut 16%
• Square Solution 16%
• Main Result 16%
• Small Set 16%
• Exponential Time 16%
• Square Method 16%