Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games

In the first-order query model for zero-sum K K matrix games, players observe the expected pay-offs for all their possible actions under the randomized action played by their opponent.