1 citations · 3 across the 19 of their papers we have counts for
4 papers · 1 filter
Near-Optimal Pure Exploration in Matrix Games: A Generalization of Stochastic Bandits & Dueling Bandits
Arnab Maiti, Ross Boczar, Kevin Jamieson +1
We study the sample complexity of identifying the pure strategy Nash equilibrium (PSNE) in a two-player zero-sum matrix game with noise. Formally, we are given a stochastic model w…
Query-Efficient Algorithm to Find all Nash Equilibria in a Two-Player Zero-Sum Matrix Game
Arnab Maiti, Ross Boczar, Kevin Jamieson +1
We study the query complexity of finding the set of all Nash equilibria in two-player zero-sum matrix games. Fearnley and Savani (2016) s…
On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games under Noisy Feedback
Arnab Maiti, Kevin Jamieson, Lillian J. Ratliff
This paper studies a variant of two-player zero-sum matrix games, where, at each timestep, the row player selects row , the column player selects column , and the row player…
Instance-dependent Sample Complexity Bounds for Zero-sum Matrix Games
Arnab Maiti, Kevin Jamieson, Lillian J. Ratliff
We study the sample complexity of identifying an approximate equilibrium for two-player zero-sum matrix games. That is, in a sequence of repeated game plays, how many r…