Pages that link to "Item:Q5172700"
From MaRDI portal
The following pages link to On oblivious PTAS's for nash equilibrium (Q5172700):
Displayed 19 items.
- Nash equilibria: complexity, symmetries, and approximation (Q458482) (← links)
- Sparse covers for sums of indicators (Q495555) (← links)
- A note on approximate Nash equilibria (Q1014628) (← links)
- Computation of sparse and dense equilibrium strategies of evolutionary games (Q1630457) (← links)
- Inapproximability results for constrained approximate Nash equilibria (Q1784945) (← links)
- Parameterized two-player Nash equilibrium (Q1949741) (← links)
- Approximate Nash equilibria in anonymous games (Q2253838) (← links)
- Bargaining dynamics in exchange networks (Q2253845) (← links)
- Learning Poisson binomial distributions (Q2345953) (← links)
- Query complexity of approximate equilibria in anonymous games (Q2403236) (← links)
- Parameterized complexity of sparse linear complementarity problems (Q2408196) (← links)
- A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium (Q3162514) (← links)
- Query Complexity of Approximate Equilibria in Anonymous Games (Q3460801) (← links)
- The Linear Complementarity Problems with a Few Variables per Constraint (Q3465945) (← links)
- Constant Rank Two-Player Games are PPAD-hard (Q4554071) (← links)
- Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem (Q4571924) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q5020727) (← links)
- Approximating the existential theory of the reals (Q5918470) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q6139831) (← links)