The following pages link to (Q3191570):
Displayed 8 items.
- Computing approximate Nash equilibria in polymatrix games (Q513277) (← 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)
- 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)