Pages that link to "Item:Q1322876"
From MaRDI portal
The following pages link to On sparse approximations to randomized strategies and convex combinations (Q1322876):
Displaying 20 items.
- On the hardness of network design for bottleneck routing games (Q389953) (← links)
- On mutual concavity and strategically-zero-sum bimatrix games (Q428856) (← links)
- Efficient methods for selfish network design (Q442104) (← links)
- Selfish splittable flows and NP-completeness (Q465681) (← links)
- Minimal zero norm solutions of linear complementarity problems (Q481048) (← links)
- Arthur and Merlin as oracles (Q649095) (← links)
- Well supported approximate equilibria in bimatrix games (Q973002) (← links)
- A note on approximate Nash equilibria (Q1014628) (← links)
- Polynomial algorithms for approximating Nash equilibria of bimatrix games (Q1014631) (← links)
- New algorithms for approximate Nash equilibria in bimatrix games (Q1041233) (← links)
- On sparse approximations to randomized strategies and convex combinations (Q1322876) (← links)
- Random bimatrix games are asymptotically easy to solve (a simple proof) (Q1678770) (← links)
- Inapproximability results for constrained approximate Nash equilibria (Q1784945) (← links)
- Computing sparse approximations deterministically (Q1915603) (← links)
- Uniformly supported approximate equilibria in families of games (Q2075637) (← links)
- Escaping Braess's paradox through approximate Caratheodory's theorem (Q2094366) (← links)
- Resolving Braess's paradox in random networks (Q2408090) (← links)
- Empirical Distribution of Equilibrium Play and Its Testing Application (Q2976138) (← links)
- Complexity limitations on one-turn quantum refereed games (Q6038714) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q6139831) (← links)
