27 citations · 187 across the 36 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
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.DS2014★ 1 cited
The Complexity of the Simplex Method
John Fearnley, Rahul Savani
The simplex method is a well-studied and widely-used pivoting method for solving linear programs. When Dantzig originally formulated the simplex method, he gave a natural pivot rul…