John Fearnley - RankMe

110 papers A* 18A 3B 9Journal 67Unranked 12

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	The Complexity of Sparse Win-Lose Bimatrix Games. CoRR Eleni Batziou, John Fearnley, Abheek Ghosh, Rahul Savani
2025	J	`jnl`	Constant Inapproximability for PPA. SIAM J. Comput. Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2025	A*	`conf`	Monotone Contractions. STOC Eleni Batziou, John Fearnley, Spencer Gordon, Ruta Mehta, Rahul Savani
2025	J	`jnl`	Pizza Sharing is PPA-hard. ACM Trans. Comput. Theory Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos
2025	J	`jnl`	The Complexity of Computing KKT Solutions of Quadratic Programs. J. ACM John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani
2024	A*	`conf`	Constant Inapproximability for Fisher Markets. EC Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2024	J	`jnl`	Monotone Contractions. CoRR Eleni Batziou, John Fearnley, Spencer Gordon, Ruta Mehta, Rahul Savani
2024	J	`jnl`	Pure-Circuit: Tight Inapproximability for PPAD. J. ACM Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2024	J	`jnl`	Super Unique Tarski is in UEOPL. CoRR John Fearnley, Rahul Savani
2024	A*	`conf`	The Complexity of Computing KKT Solutions of Quadratic Programs. STOC John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani
2024	A*	`conf`	Two Choices Are Enough for P-LCPs, USOs, and Colorful Tangents. ICALP Michaela Borzechowski, John Fearnley, Spencer Gordon, Rahul Savani, Patrick Schnider, Simon Weber
2024	J	`jnl`	Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents. CoRR Michaela Borzechowski, John Fearnley, Spencer Gordon, Rahul Savani, Patrick Schnider, Simon Weber
2023	J	`jnl`	Games on Graphs. CoRR Nathanaël Fijalkow, Nathalie Bertrand, Patricia Bouyer-Decitre, Romain Brenguier, Arnaud Carayol, John Fearnley, Hugo Gimbert, Florian Horn, Rasmus Ibsen-Jensen, Nicolas Markey, Benjamin Monmege, Petr Novotný, Mickael Randour, Ocan Sankur, Sylvain Schmitz, Olivier Serre, Mateusz Skomra
2023	J	`jnl`	The Complexity of Computing KKT Solutions of Quadratic Programs. CoRR John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani
2023	J	`jnl`	The Complexity of Gradient Descent: CLS = PPAD ∩ PLS. J. ACM John Fearnley, Paul Goldberg, Alexandros Hollender, Rahul Savani
2023	A*	`conf`	Tight Inapproximability for Graphical Games. AAAI Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2022	J	`jnl`	A Faster Algorithm for Finding Tarski Fixed Points. ACM Trans. Algorithms John Fearnley, Dömötör Pálvölgyi, Rahul Savani
2022	J	`jnl`	Approximating the existential theory of the reals. J. Comput. Syst. Sci. Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis
2022	J	`jnl`	Constant Inapproximability for PPA. CoRR Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2022	A*	`conf`	Constant inapproximability for PPA. STOC Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2022	A*	`conf`	Pizza Sharing Is PPA-Hard. AAAI Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos
2022	A*	`conf`	Pure-Circuit: Strong Inapproximability for PPAD. FOCS Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2022	J	`jnl`	Pure-Circuit: Strong Inapproximability for PPAD. CoRR Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2022	J	`jnl`	Tight Inapproximability for Graphical Games. CoRR Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2021	A	`conf`	A Faster Algorithm for Finding Tarski Fixed Points. STACS John Fearnley, Rahul Savani
2021	J	`jnl`	Computing exact solutions of consensus halving and the Borsuk-Ulam theorem. J. Comput. Syst. Sci. Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis
2021	J	`jnl`	Reachability Switching Games. Log. Methods Comput. Sci. John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani
2021	A*	`conf`	The complexity of gradient descent: CLS = PPAD ∩ PLS. STOC John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani
2020	J	`jnl`	A faster algorithm for finding Tarski fixed points. CoRR John Fearnley, Rahul Savani
2020	J	`jnl`	Hiring Secretaries over Time: The Benefit of Concurrent Employment. Math. Oper. Res. Yann Disser, John Fearnley, Martin Gairing, Oliver Göbel, Max Klimm, Daniel Schmand, Alexander Skopalik, Andreas Tönnis
2020	J	`jnl`	Lipschitz Continuity and Approximate Equilibria. Algorithmica Argyrios Deligkas, John Fearnley, Paul G. Spirakis
2020	A*	`conf`	One-Clock Priced Timed Games are PSPACE-hard. LICS John Fearnley, Rasmus Ibsen-Jensen, Rahul Savani
2020	J	`jnl`	One-Clock Priced Timed Games are PSPACE-hard. CoRR John Fearnley, Rasmus Ibsen-Jensen, Rahul Savani
2020	J	`jnl`	Square-Cut Pizza Sharing is PPA-complete. CoRR Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos
2020	J	`jnl`	The Complexity of Gradient Descent: CLS = PPAD ∩ PLS. CoRR John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani
2020	A*	`conf`	Tree Polymatrix Games Are PPAD-Hard. ICALP Argyrios Deligkas, John Fearnley, Rahul Savani
2020	J	`jnl`	Tree Polymatrix Games are PPAD-hard. CoRR Argyrios Deligkas, John Fearnley, Rahul Savani
2020	J	`jnl`	Unique end of potential line. J. Comput. Syst. Sci. John Fearnley, Spencer Gordon, Ruta Mehta, Rahul Savani
2019	J	`jnl`	An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space. Int. J. Softw. Tools Technol. Transf. John Fearnley, Sanjay Jain, Bart de Keijzer, Sven Schewe, Frank Stephan, Dominik Wojtczak
2019	A*	`conf`	Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem. ICALP Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis
2019	J	`jnl`	Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem. CoRR Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis
2019	J	`jnl`	Distributed Methods for Computing Approximate Equilibria. Algorithmica Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani
2019	A*	`conf`	Unique End of Potential Line. ICALP John Fearnley, Spencer Gordon, Ruta Mehta, Rahul Savani
2018	B	`conf`	An Improved Envy-Free Cake Cutting Protocol for Four Agents. SAGT Georgios Amanatidis, George Christodoulou, John Fearnley, Evangelos Markakis, Christos-Alexandros Psomas, Eftychia Vakaliou
2018	J	`jnl`	An Improved Envy-Free Cake Cutting Protocol for Four Agents. CoRR Georgios Amanatidis, George Christodoulou, John Fearnley, Evangelos Markakis, Christos-Alexandros Psomas, Eftychia Vakaliou
2018	—	`conf`	Approximating the Existential Theory of the Reals. WINE Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis
2018	J	`jnl`	Approximating the Existential Theory of the Reals. CoRR Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis
2018	J	`jnl`	End of Potential Line. CoRR John Fearnley, Spencer Gordon, Ruta Mehta, Rahul Savani
2018	J	`jnl`	Inapproximability results for constrained approximate Nash equilibria. Inf. Comput. Argyrios Deligkas, John Fearnley, Rahul Savani
2018	A	`conf`	Market Making via Reinforcement Learning. AAMAS Thomas Spooner, John Fearnley, Rahul Savani, Andreas Koukorinis
2018	J	`jnl`	Market Making via Reinforcement Learning. CoRR Thomas Spooner, John Fearnley, Rahul Savani, Andreas Koukorinis
2018	A*	`conf`	Reachability Switching Games. ICALP John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani
2018	J	`jnl`	The Complexity of All-switches Strategy Improvement. Log. Methods Comput. Sci. John Fearnley, Rahul Savani
2018	J	`jnl`	Unique End of Potential Line. CoRR John Fearnley, Spencer Gordon, Ruta Mehta, Rahul Savani
2017	J	`jnl`	An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space. CoRR John Fearnley, Sanjay Jain, Sven Schewe, Frank Stephan, Dominik Wojtczak
2017	—	`conf`	An ordered approach to solving parity games in quasi polynomial time and quasi linear space. SPIN John Fearnley, Sanjay Jain, Sven Schewe, Frank Stephan, Dominik Wojtczak
2017	J	`jnl`	CLS: New Problems and Completeness. CoRR John Fearnley, Spencer Gordon, Ruta Mehta, Rahul Savani
2017	J	`jnl`	Computing Approximate Nash Equilibria in Polymatrix Games. Algorithmica Argyrios Deligkas, John Fearnley, Rahul Savani, Paul G. Spirakis
2017	B	`conf`	Computing Constrained Approximate Equilibria in Polymatrix Games. SAGT Argyrios Deligkas, John Fearnley, Rahul Savani
2017	J	`jnl`	Computing Constrained Approximate Equilibria in Polymatrix Games. CoRR Argyrios Deligkas, John Fearnley, Rahul Savani
2017	—	`conf`	Efficient Parallel Strategy Improvement for Parity Games. CAV (2) John Fearnley
2017	J	`jnl`	Efficient Parallel Strategy Improvement for Parity Games. CoRR John Fearnley
2017	J	`jnl`	Reachability Switching Games. CoRR John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani
2016	A	`conf`	An Empirical Study on Computing Equilibria in Polymatrix Games. AAMAS Argyrios Deligkas, John Fearnley, Tobenna Peter Igwe, Rahul Savani
2016	J	`jnl`	An Empirical Study on Computing Equilibria in Polymatrix Games. CoRR Argyrios Deligkas, John Fearnley, Tobenna Peter Igwe, Rahul Savani
2016	J	`jnl`	Approximate Well-supported Nash Equilibria Below Two-thirds. Algorithmica John Fearnley, Paul W. Goldberg, Rahul Savani, Troels Bjerre Sørensen
2016	—	`conf`	Distributed Methods for Computing Approximate Equilibria. WINE Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani
2016	J	`jnl`	Efficient approximation of optimal control for continuous-time Markov games. Inf. Comput. John Fearnley, Markus N. Rabe, Sven Schewe, Lijun Zhang
2016	J	`jnl`	Finding Approximate Nash Equilibria of Bimatrix Games via Payoff Queries. ACM Trans. Economics and Comput. John Fearnley, Rahul Savani
2016	J	`jnl`	Hiring Secretaries over Time: The Benefit of Concurrent Employment. CoRR Yann Disser, John Fearnley, Martin Gairing, Oliver Göbel, Max Klimm, Daniel Schmand, Alexander Skopalik, Andreas Tönnis
2016	—	`conf`	Inapproximability Results for Approximate Nash Equilibria. WINE Argyrios Deligkas, John Fearnley, Rahul Savani
2016	J	`jnl`	Inapproximability Results for Approximate Nash Equilibria. CoRR Argyrios Deligkas, John Fearnley, Rahul Savani
2016	B	`conf`	Lipschitz Continuity and Approximate Equilibria. SAGT Argyrios Deligkas, John Fearnley, Paul G. Spirakis
2016	A*	`conf`	The Complexity of All-switches Strategy Improvement. SODA John Fearnley, Rahul Savani
2015	B	`conf`	An Empirical Study of Finding Approximate Equilibria in Bimatrix Games. SEA John Fearnley, Tobenna Peter Igwe, Rahul Savani
2015	J	`jnl`	An Empirical Study of Finding Approximate Equilibria in Bimatrix Games. CoRR John Fearnley, Tobenna Peter Igwe, Rahul Savani
2015	J	`jnl`	Distributed Methods for Computing Approximate Equilibria. CoRR Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani
2015	J	`jnl`	Learning equilibria of games via payoff queries. J. Mach. Learn. Res. John Fearnley, Martin Gairing, Paul W. Goldberg, Rahul Savani
2015	J	`jnl`	Reachability in two-clock timed automata is PSPACE-complete. Inf. Comput. John Fearnley, Marcin Jurdzinski
2015	J	`jnl`	Synthesis of succinct systems. J. Comput. Syst. Sci. John Fearnley, Doron A. Peled, Sven Schewe
2015	J	`jnl`	The Complexity of All-switches Strategy Improvement. CoRR John Fearnley, Rahul Savani
2015	A*	`conf`	The Complexity of the Simplex Method. STOC John Fearnley, Rahul Savani
2014	—	`conf`	Computing Approximate Nash Equilibria in Polymatrix Games. WINE Argyrios Deligkas, John Fearnley, Rahul Savani, Paul G. Spirakis
2014	J	`jnl`	Computing Approximate Nash Equilibria in Polymatrix Games. CoRR Argyrios Deligkas, John Fearnley, Rahul Savani, Paul G. Spirakis
2014	A*	`conf`	Finding approximate Nash equilibria of bimatrix games via payoff queries. EC John Fearnley, Rahul Savani
2014	J	`jnl`	The Complexity of the Simplex Method. CoRR John Fearnley, Rahul Savani
2013	J	`jnl`	Finding Approximate Nash Equilibria of Bimatrix Games via Payoff Queries. CoRR John Fearnley, Rahul Savani
2013	J	`jnl`	Learning Equilibria of Games via Payoff Queries CoRR John Fearnley, Martin Gairing, Paul W. Goldberg, Rahul Savani
2013	A*	`conf`	Learning equilibria of games via payoff queries. EC John Fearnley, Martin Gairing, Paul Goldberg, Rahul Savani
2013	—	`conf`	Reachability in Two-Clock Timed Automata Is PSPACE-Complete. ICALP (2) John Fearnley, Marcin Jurdzinski
2013	J	`jnl`	Reachability in Two-Clock Timed Automata is PSPACE-complete CoRR John Fearnley, Marcin Jurdzinski
2013	J	`jnl`	Time and Space Results for Parity Games with Bounded Treewidth Log. Methods Comput. Sci. John Fearnley, Sven Schewe
2012	B	`conf`	Approximate Well-Supported Nash Equilibria Below Two-Thirds. SAGT John Fearnley, Paul W. Goldberg, Rahul Savani, Troels Bjerre Sørensen
2012	J	`jnl`	Approximate Well-supported Nash Equilibria below Two-thirds CoRR John Fearnley, Paul W. Goldberg, Rahul Savani, Troels Bjerre Sørensen
2012	J	`jnl`	Bounded Satisfiability for PCTL CoRR Nathalie Bertrand, John Fearnley, Sven Schewe
2012	B	`conf`	Bounded Satisfiability for PCTL. CSL Nathalie Bertrand, John Fearnley, Sven Schewe
2012	J	`jnl`	Playing Muller Games in a Hurry. Int. J. Found. Comput. Sci. John Fearnley, Martin Zimmermann
2012	J	`jnl`	Synthesis of Succinct Systems CoRR John Fearnley, Doron A. Peled, Sven Schewe
2012	B	`conf`	Synthesis of Succinct Systems. ATVA John Fearnley, Doron A. Peled, Sven Schewe
2012	—	`conf`	Time and Parallelizability Results for Parity Games with Bounded Treewidth. ICALP (2) John Fearnley, Sven Schewe
2011	—	`conf`	Efficient Approximation of Optimal Control for Continuous-Time Markov Games. FSTTCS John Fearnley, Markus N. Rabe, Sven Schewe, Lijun Zhang
2011	B	`conf`	Parity Games on Graphs with Medium Tree-Width. MFCS John Fearnley, Oded Lachish
2010	J	`jnl`	Exponential Lower Bounds For Policy Iteration CoRR John Fearnley
2010	—	`conf`	Exponential Lower Bounds for Policy Iteration. ICALP (2) John Fearnley
2010	B	`conf`	Linear Complementarity Algorithms for Infinite Games. SOFSEM John Fearnley, Marcin Jurdzinski, Rahul Savani
2010	J	`jnl`	Non-oblivious Strategy Improvement CoRR John Fearnley
2010	—	`conf`	Non-oblivious Strategy Improvement. LPAR (Dakar) John Fearnley
2010	—	`conf`	Playing Muller Games in a Hurry GANDALF John Fearnley, Martin Zimmermann
2010	—	`—`	Strategy iteration algorithms for games and Markov decision processes. John Fearnley
2009	J	`jnl`	Linear Complementarity Algorithms for Infinite Games CoRR John Fearnley, Marcin Jurdzinski, Rahul Savani