14 citations · 14 across the 3 of their papers we have counts for
3 papers
cs.GT2015
An Empirical Study of Finding Approximate Equilibria in Bimatrix Games
John Fearnley, Tobenna Peter Igwe, Rahul Savani
While there have been a number of studies about the efficacy of methods to find exact Nash equilibria in bimatrix games, there has been little empirical work on finding approximate…
cs.GT2014★ 14 cited
Computing Approximate Nash Equilibria in Polymatrix Games
Argyrios Deligkas, John Fearnley, Rahul Savani +1
In an -Nash equilibrium, a player can gain at most by unilaterally changing his behaviour. For two-player (bimatrix) games with payoffs in , the best-known achieva…
cs.DS2010
Exponential Lower Bounds For Policy Iteration
John Fearnley
We study policy iteration for infinite-horizon Markov decision processes. It has recently been shown policy iteration style algorithms have exponential lower bounds in a two player…