Share This Author
Reachability in two-clock timed automata is PSPACE-complete
- John Fearnley, M. Jurdzinski
- Computer ScienceInf. Comput.
- 13 February 2013
Exponential Lower Bounds for Policy Iteration
- John Fearnley
- Computer Science, MathematicsICALP
- 17 March 2010
TLDR
Market Making via Reinforcement Learning
- Thomas Spooner, John Fearnley, Rahul Savani, Andreas Koukorinis
- Computer ScienceAAMAS
- 11 April 2018
TLDR
An ordered approach to solving parity games in quasi polynomial time and quasi linear space
- John Fearnley, Sanjay Jain, S. Schewe, F. Stephan, D. Wojtczak
- Computer ScienceSPIN
- 3 March 2017
TLDR
Non-oblivious Strategy Improvement
- John Fearnley
- Computer ScienceLPAR
- 15 March 2010
TLDR
Learning equilibria of games via payoff queries
- John Fearnley, Martin Gairing, P. Goldberg, Rahul Savani
- EconomicsEC '13
- 13 February 2013
TLDR
Computing Approximate Nash Equilibria in Polymatrix Games
- Argyrios Deligkas, John Fearnley, Rahul Savani, P. Spirakis
- Economics, Computer ScienceAlgorithmica
- 12 September 2014
TLDR
The Complexity of the Simplex Method
- John Fearnley, Rahul Savani
- Computer Science, MathematicsSTOC
- 2 April 2014
TLDR
Distributed Methods for Computing Approximate Equilibria
- A. Czumaj, Argyrios Deligkas, M. Fasoulakis, John Fearnley, M. Jurdzinski, Rahul Savani
- Computer Science, EconomicsAlgorithmica
- 10 December 2015
TLDR
Unique End of Potential Line
- John Fearnley, Spencer Gordon, R. Mehta, Rahul Savani
- MathematicsICALP
- 9 November 2018
TLDR
...
...