Before revision:  This paper proposes new learning algorithms in two-player zero-sum  games where the number of pure strategies is huge or even infinite . Specifically, we combine no-regret analysis from online learning with double oracle methods from game theory.
After revision:  This paper proposes new learning algorithms for solving two-player zero-sum games where the number of pure strategies is huge or even infinite . Specifically, we combine no-regret analysis from online learning with double oracle methods from game theory.