26 citations · 203 across the 41 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.GT2013
Finding Approximate Nash Equilibria of Bimatrix Games via Payoff Queries
John Fearnley, Rahul Savani
We study the deterministic and randomized query complexity of finding approximate equilibria in bimatrix games. We show that the deterministic query complexity of finding an -Na…
cs.GT2013★ 3 cited
Polylogarithmic Supports are required for Approximate Well-Supported Nash Equilibria below 2/3
Yogesh Anbalagan, Sergey Norin, Rahul Savani +1
In an epsilon-approximate Nash equilibrium, a player can gain at most epsilon in expectation by unilateral deviation. An epsilon well-supported approximate Nash equilibrium has the…
cs.GT2013★ 6 cited
Learning Equilibria of Games via Payoff Queries
John Fearnley, Martin Gairing, Paul Goldberg +1
A recent body of experimental literature has studied empirical game-theoretical analysis, in which we have partial knowledge of a game, consisting of observations of a subset of th…