Showing 2023Show all
2 papers · 1 filter
cs.LG2023
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…
cs.GT2023
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…