The Oracle Complexity of Simplex-based Matrix Games

Abstract

We study the problem of solving matrix games of the form $\min_{\mathbf{p}\in\Delta}\max_{\mathbf{w}\in\mathcal{W}}\mathbf{p}^{\top}A\mathbf{w}$, where $A$ is a matrix and $\Delta$ is the probability simplex. This problem encapsulates canonical tasks such as finding a linear separator and computing Nash equilibria in zero-sum games. However, perhaps surprisingly, its inherent complexity (as formalized in the standard framework of oracle complexity) is not well understood. In this work, we first identify different oracle models that are implicitly used by prior algorithms, corresponding to multiplying the matrix $A$ by a vector from either one or both sides. We then prove complexity lower bounds for algorithms under both access models, which in particular imply a separation between them. As our main result, we prove that in the general $\ell_p$/simplex setting where $\mathcal{W}$ is an $\ell_p$ ball for $p\in[1,\infty]$, any algorithm that utilizes two-sided matrix-vector multiplications requires $\tilde{\Omega}(\epsilon^{-2/3})$ iterations to return an $\epsilon$-suboptimal solution. For any $p\in[1,\infty]$, this is either the first lower bound for such problems, or an exponential improvement over the previously best-known results. Moreover, for the canonical tasks of finding a linear separator and computing a Nash equilibrium, our lower bounds match (up to log factors) recent algorithms of Karmarkar, O'Carroll and Sidford (2026), thereby resolving their oracle complexities in a natural setting.