27 citations · 187 across the 36 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.FL2013★ 27 cited
Reachability in Two-Clock Timed Automata is PSPACE-complete
John Fearnley, Marcin Jurdziński
A recent result of Haase et al. has shown that reachability in two-clock timed automata is log-space equivalent to reachability in bounded one-counter automata. We show that reacha…
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…