The following pages link to (Q5365135):
Displaying 25 items.
- Nash equilibria: complexity, symmetries, and approximation (Q458482) (← links)
- Approximations of Nash equilibria (Q959971) (← links)
- On the complexity of succinct zero-sum games (Q1024660) (← links)
- On the difficulty of approximately maximizing agreements. (Q1401958) (← links)
- Approximate Nash equilibria in anonymous games (Q2253838) (← links)
- On tightness of the Tsaknakis-Spirakis algorithm for approximate Nash equilibrium (Q2670913) (← links)
- Can almost everybody be almost happy? (Q2800547) (← links)
- Logarithmic Query Complexity for Approximate Nash Computation in Large Games (Q2819443) (← links)
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium (Q2829231) (← links)
- The complexity of computing a Nash equilibrium (Q2931371) (← links)
- The Computational Complexity of Nash Equilibria in Concisely Represented Games (Q2947564) (← links)
- (Q2993483) (← links)
- On the Complexity of Nash Equilibria and Other Fixed Points (Q3068643) (← links)
- Inapproximability of NP-Complete Variants of Nash Equilibrium (Q3088077) (← links)
- The Complexity of Nash Equilibria in Limit-Average Games (Q3090850) (← links)
- Inapproximability of NP-complete variants of Nash equilibrium (Q3191570) (← links)
- Approximating Wardrop Equilibria with Finitely Many Agents (Q3523211) (← links)
- (Q3568105) (← links)
- Inapproximability of Nash Equilibrium (Q4571923) (← links)
- (Q4638083) (← links)
- (Q4638112) (← links)
- On oblivious PTAS's for nash equilibrium (Q5172700) (← links)
- Query complexity of approximate nash equilibria (Q5259589) (← links)
- The Computation of Approximate Generalized Feedback Nash Equilibria (Q5883327) (← links)
- PPAD-complete pure approximate Nash equilibria in Lipschitz games (Q6164508) (← links)
