Exponential Lower Bounds for Policy Iteration. - John Fearnley (ICALP (2), 2010)

Non-oblivious Strategy Improvement. - John Fearnley (LPAR (Dakar), 2010)

Linear Complementarity Algorithms for Infinite Games. - John Fearnley; Marcin Jurdzinski; Rahul Savani (SOFSEM, 2010)

Strategy iteration algorithms for games and Markov decision processes. - John Fearnley (2010)

Parity Games on Graphs with Medium Tree-Width. - John Fearnley; Oded Lachish (MFCS, 2011)

Bounded Satisfiability for PCTL. - Nathalie Bertrand 001; John Fearnley; Sven Schewe (CSL, 2012)

Time and Parallelizability Results for Parity Games with Bounded Treewidth. - John Fearnley; Sven Schewe (ICALP (2), 2012)

Playing Muller Games in a Hurry. - John Fearnley; Martin Zimmermann 002 (Int. J. Found. Comput. Sci., 2012)

Time and Space Results for Parity Games with Bounded Treewidth - John Fearnley; Sven Schewe (Log. Methods Comput. Sci., 2013)

The Complexity of the Simplex Method. - John Fearnley; Rahul Savani (STOC, 2015)

An Empirical Study of Finding Approximate Equilibria in Bimatrix Games. - John Fearnley; Tobenna Peter Igwe; Rahul Savani (SEA, 2015)

Reachability in two-clock timed automata is PSPACE-complete. - John Fearnley; Marcin Jurdzinski (Inf. Comput., 2015)

Synthesis of succinct systems. - John Fearnley; Doron A. Peled; Sven Schewe (J. Comput. Syst. Sci., 2015)

Learning equilibria of games via payoff queries. - John Fearnley; Martin Gairing; Paul W. Goldberg; Rahul Savani (J. Mach. Learn. Res., 2015)

An Empirical Study on Computing Equilibria in Polymatrix Games. - Argyrios Deligkas; John Fearnley; Tobenna Peter Igwe; Rahul Savani (AAMAS, 2016)

Inapproximability Results for Approximate Nash Equilibria. - Argyrios Deligkas; John Fearnley; Rahul Savani (WINE, 2016)

Approximate Well-supported Nash Equilibria Below Two-thirds. - John Fearnley; Paul W. Goldberg; Rahul Savani; Troels Bjerre Sørensen (Algorithmica, 2016)

Efficient approximation of optimal control for continuous-time Markov games. - John Fearnley; Markus N. Rabe; Sven Schewe; Lijun Zhang 001 (Inf. Comput., 2016)

Finding Approximate Nash Equilibria of Bimatrix Games via Payoff Queries. - John Fearnley; Rahul Savani (ACM Trans. Economics and Comput., 2016)

Efficient Parallel Strategy Improvement for Parity Games. - John Fearnley (CAV (2), 2017)

Computing Constrained Approximate Equilibria in Polymatrix Games. - Argyrios Deligkas; John Fearnley; Rahul Savani (SAGT, 2017)

An ordered approach to solving parity games in quasi polynomial time and quasi linear space. - John Fearnley; Sanjay Jain 001; Sven Schewe; Frank Stephan 001; Dominik Wojtczak (SPIN, 2017)

Computing Approximate Nash Equilibria in Polymatrix Games. - Argyrios Deligkas; John Fearnley; Rahul Savani; Paul G. Spirakis (Algorithmica, 2017)

CLS: New Problems and Completeness. - John Fearnley; Spencer Gordon; Ruta Mehta; Rahul Savani (CoRR, 2017)

Market Making via Reinforcement Learning. - Thomas Spooner; John Fearnley; Rahul Savani; Andreas Koukorinis (AAMAS, 2018)

An Improved Envy-Free Cake Cutting Protocol for Four Agents. - Georgios Amanatidis; George Christodoulou 001; John Fearnley; Evangelos Markakis; Christos-Alexandros Psomas; Eftychia Vakaliou (SAGT, 2018)

End of Potential Line. - John Fearnley; Spencer Gordon; Ruta Mehta; Rahul Savani (CoRR, 2018)

Inapproximability results for constrained approximate Nash equilibria. - Argyrios Deligkas; John Fearnley; Rahul Savani (Inf. Comput., 2018)

The Complexity of All-switches Strategy Improvement. - John Fearnley; Rahul Savani (Log. Methods Comput. Sci., 2018)

Distributed Methods for Computing Approximate Equilibria. - Artur Czumaj; Argyrios Deligkas; Michail Fasoulakis; John Fearnley; Marcin Jurdzinski; Rahul Savani (Algorithmica, 2019)

An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space. - John Fearnley; Sanjay Jain 001; Bart de Keijzer; Sven Schewe; Frank Stephan 001; Dominik Wojtczak (Int. J. Softw. Tools Technol. Transf., 2019)

Tree Polymatrix Games Are PPAD-Hard. - Argyrios Deligkas; John Fearnley; Rahul Savani (ICALP, 2020)

One-Clock Priced Timed Games are PSPACE-hard. - John Fearnley; Rasmus Ibsen-Jensen; Rahul Savani (LICS, 2020)

Lipschitz Continuity and Approximate Equilibria. - Argyrios Deligkas; John Fearnley; Paul G. Spirakis (Algorithmica, 2020)

Square-Cut Pizza Sharing is PPA-complete. - Argyrios Deligkas; John Fearnley; Themistoklis Melissourgos (CoRR, 2020)

Unique end of potential line. - John Fearnley; Spencer Gordon; Ruta Mehta; Rahul Savani (J. Comput. Syst. Sci., 2020)

Hiring Secretaries over Time: The Benefit of Concurrent Employment. - Yann Disser; John Fearnley; Martin Gairing; Oliver Göbel 002; Max Klimm; Daniel Schmand; Alexander Skopalik; Andreas Tönnis (Math. Oper. Res., 2020)

A Faster Algorithm for Finding Tarski Fixed Points. - John Fearnley; Rahul Savani (STACS, 2021)

Computing exact solutions of consensus halving and the Borsuk-Ulam theorem. - Argyrios Deligkas; John Fearnley; Themistoklis Melissourgos; Paul G. Spirakis (J. Comput. Syst. Sci., 2021)

Reachability Switching Games. - John Fearnley; Martin Gairing; Matthias Mnich; Rahul Savani (Log. Methods Comput. Sci., 2021)

Pizza Sharing Is PPA-Hard. - Argyrios Deligkas; John Fearnley; Themistoklis Melissourgos (AAAI, 2022)

Pure-Circuit: Strong Inapproximability for PPAD. - Argyrios Deligkas; John Fearnley; Alexandros Hollender; Themistoklis Melissourgos (FOCS, 2022)

Approximating the existential theory of the reals. - Argyrios Deligkas; John Fearnley; Themistoklis Melissourgos; Paul G. Spirakis (J. Comput. Syst. Sci., 2022)

A Faster Algorithm for Finding Tarski Fixed Points. - John Fearnley; Dömötör Pálvölgyi; Rahul Savani (ACM Trans. Algorithms, 2022)

Tight Inapproximability for Graphical Games. - Argyrios Deligkas; John Fearnley; Alexandros Hollender; Themistoklis Melissourgos (AAAI, 2023)

Games on Graphs. - Nathanaël Fijalkow; Nathalie Bertrand 001; Patricia Bouyer-Decitre; Romain Brenguier; Arnaud Carayol; John Fearnley; Hugo Gimbert; Florian Horn 001; Rasmus Ibsen-Jensen; Nicolas Markey; Benjamin Monmege; Petr Novotný 001; et al. (CoRR, 2023)

The Complexity of Gradient Descent: CLS = PPAD ∩ PLS. - John Fearnley; Paul Goldberg 001; Alexandros Hollender; Rahul Savani (J. ACM, 2023)

Two Choices Are Enough for P-LCPs, USOs, and Colorful Tangents. - Michaela Borzechowski; John Fearnley; Spencer Gordon; Rahul Savani; Patrick Schnider; Simon Weber 001 (ICALP, 2024)

Constant Inapproximability for Fisher Markets. - Argyrios Deligkas; John Fearnley; Alexandros Hollender; Themistoklis Melissourgos (EC, 2024)

The Complexity of Computing KKT Solutions of Quadratic Programs. - John Fearnley; Paul W. Goldberg; Alexandros Hollender; Rahul Savani (STOC, 2024)

Super Unique Tarski is in UEOPL. - John Fearnley; Rahul Savani (CoRR, 2024)

Pure-Circuit: Tight Inapproximability for PPAD. - Argyrios Deligkas; John Fearnley; Alexandros Hollender; Themistoklis Melissourgos (J. ACM, 2024)

Monotone Contractions. - Eleni Batziou; John Fearnley; Spencer Gordon; Ruta Mehta; Rahul Savani (STOC, 2025)

Constant Inapproximability for PPA. - Argyrios Deligkas; John Fearnley; Alexandros Hollender; Themistoklis Melissourgos (SIAM J. Comput., 2025)