Pages that link to "Item:Q3191570"
From MaRDI portal
The following pages link to Inapproximability of NP-complete variants of Nash equilibrium (Q3191570):
Displaying 15 items.
- \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games (Q390917) (← links)
- Computing approximate Nash equilibria in polymatrix games (Q513277) (← links)
- New complexity results about Nash equilibria (Q932810) (← links)
- Finding a Nash equilibrium in spatial games is an NP-complete problem (Q1424226) (← links)
- Ex post Nash equilibrium in linear Bayesian games for decision making in multi-environments (Q1712152) (← links)
- 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)
- Inapproximability of NP-Complete Variants of Nash Equilibrium (Q3088077) (← links)
- (Q3089367) (← links)
- A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem (Q4634034) (← 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)
- Computational complexity of decision problems about Nash equilibria in win-lose multi-player games (Q6546277) (← links)