John Fearnley

Available identifiers

zbMath Open fearnley.johnMaRDI QIDQ259048

List of research outcomes

Publication	Date of Publication	Type
Constant inapproximability for PPA	2023-12-08	Paper
The complexity of gradient descent: CLS = PPAD ∩ PLS	2023-11-14	Paper
A Faster Algorithm for Finding Tarski Fixed Points	2023-10-31	Paper
Efficient parallel strategy improvement for parity games	2022-08-12	Paper
Unique End of Potential Line	2022-07-21	Paper
Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem	2022-07-21	Paper
Approximating the existential theory of the reals	2022-01-31	Paper
Reachability Switching Games	2021-07-28	Paper
https://portal.mardi4nfdi.de/entity/Q4989405	2021-05-25	Paper
https://portal.mardi4nfdi.de/entity/Q5151006	2021-02-16	Paper
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem	2021-02-02	Paper
One-Clock Priced Timed Games are PSPACE-hard	2021-01-21	Paper
Lipschitz continuity and approximate equilibria	2020-10-12	Paper
Unique end of potential line	2020-09-07	Paper
Approximating the existential theory of the reals	2020-06-18	Paper
Hiring Secretaries over Time: The Benefit of Concurrent Employment	2020-04-30	Paper
Distributed methods for computing approximate equilibria	2019-03-11	Paper
An improved envy-free cake cutting protocol for four agents	2018-11-08	Paper
https://portal.mardi4nfdi.de/entity/Q4553289	2018-11-02	Paper
Inapproximability results for constrained approximate Nash equilibria	2018-09-27	Paper
The Complexity of All-switches Strategy Improvement	2018-07-16	Paper
Computing constrained approximate equilibria in polymatrix games	2018-02-13	Paper
Computing approximate Nash equilibria in polymatrix games	2017-03-03	Paper
Distributed Methods for Computing Approximate Equilibria	2017-02-10	Paper
Inapproximability Results for Approximate Nash Equilibria	2017-02-10	Paper
Approximate well-supported Nash equilibria below two-thirds	2016-10-21	Paper
Lipschitz Continuity and Approximate Equilibria	2016-09-29	Paper
Efficient approximation of optimal control for continuous-time Markov games	2016-03-10	Paper
https://portal.mardi4nfdi.de/entity/Q5744805	2016-02-19	Paper
The Complexity of the Simplex Method	2015-08-21	Paper
Synthesis of succinct systems	2015-07-13	Paper
Reachability in two-clock timed automata is PSPACE-complete	2015-06-09	Paper
Computing Approximate Nash Equilibria in Polymatrix Games	2015-01-07	Paper
Reachability in Two-Clock Timed Automata Is PSPACE-Complete	2013-08-07	Paper
Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width	2013-06-20	Paper
Approximate well-supported Nash equilibria below two-thirds	2013-03-13	Paper
Bounded Satisfiability for PCTL	2012-11-22	Paper
Synthesis of Succinct Systems	2012-11-21	Paper
Time and Parallelizability Results for Parity Games with Bounded Treewidth	2012-11-01	Paper
Efficient Approximation of Optimal Control for Markov Games	2012-08-31	Paper
PLAYING MULLER GAMES IN A HURRY	2012-08-30	Paper
Parity Games on Graphs with Medium Tree-Width	2011-08-17	Paper
Non-oblivious Strategy Improvement	2011-01-07	Paper
Exponential Lower Bounds for Policy Iteration	2010-09-07	Paper
Linear Complementarity Algorithms for Infinite Games	2010-01-28	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: John Fearnley