Solving Matrix Games with Near-Optimal Matvec Complexity

Ishani Karmarkar, Liam O'Carroll, Aaron Sidford. Solving Matrix Games with Near-Optimal Matvec Complexity. In Aditya Bhaskara, Artur Czumaj, editors, Proceedings of the 58th Annual ACM Symposium on Theory of Computing, STOC 2026, Salt Lake City, UT, USA, June 22-26, 2026. pages 1728-1738, ACM, 2026. [doi]

Abstract

Abstract is missing.