Pages that link to "Item:Q3088077"
From MaRDI portal
The following pages link to Inapproximability of NP-Complete Variants of Nash Equilibrium (Q3088077):
Displaying 7 items.
- \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games (Q390917) (← links)
- How Hard Is It to Approximate the Best Nash Equilibrium? (Q2999855) (← links)
- Inapproximability of NP-Complete Variants of Nash Equilibrium (Q3088077) (← links)
- (Q3089367) (← links)
- Inapproximability of NP-complete variants of Nash equilibrium (Q3191570) (← links)
- Inapproximability of Nash Equilibrium (Q4571923) (← links)
- A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games (Q6055559) (← links)