A deterministic algorithm computes an epsilon-approximate Nash equilibrium in zero-sum games using O~(epsilon^{-8/9}) matrix-vector oracle queries, improving the 20-year-old O~(epsilon^{-1}) bound.
Low-rank approximation with matrix- vector products
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
ACCEPT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Solving Zero-Sum Games with Fewer Matrix-Vector Products
A deterministic algorithm computes an epsilon-approximate Nash equilibrium in zero-sum games using O~(epsilon^{-8/9}) matrix-vector oracle queries, improving the 20-year-old O~(epsilon^{-1}) bound.