Pages that link to "Item:Q5363042"
From MaRDI portal
The following pages link to 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):
Displaying 11 items.
- Inapproximability results for constrained approximate Nash equilibria (Q1784945) (← links)
- Inapproximability Results for Approximate Nash Equilibria (Q2959816) (← links)
- How Hard Is It to Approximate the Best Nash Equilibrium? (Q2999855) (← links)
- Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem (Q4571924) (← links)
- (Q4638059) (← links)
- (Q4638096) (← links)
- Approximating the existential theory of the reals (Q5918470) (← links)
- Approximating the existential theory of the reals (Q5918881) (← links)
- Quasipolynomiality of the Smallest Missing Induced Subgraph (Q6051910) (← links)
- A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games (Q6055559) (← links)
- A note on hardness of computing recursive teaching dimension (Q6072213) (← links)