Reproduce “Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Hédi Hadiji, Sarah Sachs, Tim van Erven, Wouter M. Koolen
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.