Pages that link to "Item:Q2999855"
From MaRDI portal
The following pages link to How Hard Is It to Approximate the Best Nash Equilibrium? (Q2999855):
Displaying 25 items.
- Optimal detection of sparse principal components in high dimension (Q385763) (← links)
- On perfect Nash equilibria of polymatrix games (Q457873) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation (Q896191) (← links)
- What is rational about Nash equilibria? (Q1595323) (← links)
- Inapproximability results for constrained approximate Nash equilibria (Q1784945) (← links)
- Abstracting Nash equilibria of supermodular games (Q1791275) (← links)
- Statistical and computational limits for sparse matrix detection (Q2196237) (← links)
- On the hardness of designing public signals (Q2278949) (← links)
- Computational barriers in minimax submatrix detection (Q2352736) (← links)
- How risky is it to deviate from Nash equilibrium? (Q2822032) (← links)
- On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms (Q2944569) (← links)
- The Ehrenfeucht-Fraïssé Method and the Planted Clique Conjecture (Q2947167) (← links)
- Inapproximability Results for Approximate Nash Equilibria (Q2959816) (← links)
- Inapproximability of NP-Complete Variants of Nash Equilibrium (Q3088077) (← links)
- A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium (Q3162514) (← links)
- Inapproximability of NP-complete variants of Nash equilibrium (Q3191570) (← links)
- If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283) (← links)
- Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem (Q4571924) (← links)
- A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem (Q4634034) (← links)
- Approximating the best Nash Equilibrium in <i>n<sup>o</sup></i><sup>(log <i>n</i>)</sup>-time breaks the Exponential Time Hypothesis (Q5363042) (← links)
- Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning (Q5870483) (← links)
- Approximating the existential theory of the reals (Q5918470) (← links)
- Approximating the existential theory of the reals (Q5918881) (← links)
- Cryptography from planted graphs: security with logarithmic-size messages (Q6581792) (← links)