John Fearnley
John Fearnley
Bestätigte E-Mail-Adresse bei - Startseite
Zitiert von
Zitiert von
Market Making via Reinforcement Learning
T Spooner, J Fearnley, R Savani, A Koukorinis
Proceedings of the 17th International Conference on Autonomous Agents and …, 2018
Exponential lower bounds for policy iteration
J Fearnley
International Colloquium on Automata, Languages, and Programming, 551-562, 2010
An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space
J Fearnley, S Jain, B de Keijzer, S Schewe, F Stephan, D Wojtczak
International Journal on Software Tools for Technology Transfer 21 (3), 325-349, 2019
Reachability in two-clock timed automata is PSPACE-complete
J Fearnley, M Jurdziński
Information and Computation 243, 26-36, 2015
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS
J Fearnley, P Goldberg, A Hollender, R Savani
JOURNAL OF THE ACM 70 (1), 46-59, 2023
Learning equilibria of games via payoff queries
J Fearnley, M Gairing, PW Goldberg, R Savani
The Journal of Machine Learning Research 16 (1), 1305-1344, 2015
Unique end of potential line
J Fearnley, S Gordon, R Mehta, R Savani
Journal of Computer and System Sciences 114, 1-35, 2020
Computing approximate Nash equilibria in polymatrix games
A Deligkas, J Fearnley, R Savani, P Spirakis
Algorithmica 77 (2), 487-514, 2017
The complexity of the simplex method
J Fearnley, R Savani
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
Approximate well-supported Nash equilibria below two-thirds
J Fearnley, PW Goldberg, R Savani, TB Sørensen
Algorithmica 76 (2), 297-319, 2016
Finding approximate Nash equilibria of bimatrix games via payoff queries
J Fearnley, R Savani
ACM Transactions on Economics and Computation (TEAC) 4 (4), 1-19, 2016
Distributed methods for computing approximate equilibria
A Czumaj, A Deligkas, M Fasoulakis, J Fearnley, M Jurdziński, R Savani
Algorithmica 81 (3), 1205-1231, 2019
Inapproximability Results for Constrained Approximate Nash Equilibria
A Deligkas, J Fearnley, R Savani
Information and Computation, 2018
Efficient approximation of optimal control for continuous-time Markov games
J Fearnley, MN Rabe, S Schewe, L Zhang
Information and Computation 247, 106-129, 2016
Non-oblivious strategy improvement
J Fearnley
International Conference on Logic for Programming Artificial Intelligence …, 2010
Computing exact solutions of Consensus Halving and the Borsuk-Ulam theorem
A Deligkas, J Fearnley, T Melissourgos, PG Spirakis
Journal of Computer and System Sciences, 2020
Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width
S Schewe, J Fearnley
Logical Methods in Computer Science 9, 2013
Bounded Satisfiability for PCTL
N Bertrand, J Fearnley, S Schewe
arXiv preprint arXiv:1204.0469, 2012
Tree Polymatrix Games are PPAD-hard
A Deligkas, J Fearnley, R Savani
arXiv preprint arXiv:2002.12119, 2020
A faster algorithm for finding Tarski fixed points
J Fearnley, D Pálvölgyi, R Savani
ACM Transactions on Algorithms (TALG) 18 (3), 1-23, 2022
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20