Browse by People

Fearnley, John, Goldberg, Paul W, Savani, Rahul ORCID: 0000-0003-1262-7831 and Sørensen, Troels Bjerre (2016) Approximate Well-supported Nash Equilibria Below Two-thirds. Algorithmica, 76 (2). pp. 297-319.

Deligkas, Argyrios, Fearnley, John, Melissourgos, Themistoklis ORCID: 0000-0002-9867-6257 and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2018) Approximating the Existential Theory of the Reals. In: 14th Conference on Web and Internet Economics (WINE 2018), 2018-12-15 - 2018-12-17, Oxford , UK.

Deligkas, Argyrios, Fearnley, John, Melissourgos, Themistoklis and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2022) Approximating the existential theory of the reals. Journal of Computer and System Sciences, 125. pp. 106-128.

Spooner, Thomas ORCID: 0000-0002-1732-7582, Jones, Anne E, Fearnley, John, Savani, Rahul ORCID: 0000-0003-1262-7831, Turner, Joanne ORCID: 0000-0002-0258-2353 and Baylis, Matthew ORCID: 0000-0003-0335-187X (2020) Bayesian optimisation of restriction zones for bluetongue control. Scientific Reports, 10 (1). p. 15139.

Fearnley, John, Gordon, Spencer, Mehta, Ruta and Savani, Rahul ORCID: 0000-0003-1262-7831 (2017) CLS: New Problems and Completeness. . (Unpublished)

Fearnley, John, Goldberg, Paul, Hollender, Alexandros and Savani, Rahul ORCID: 0000-0003-1262-7831 (2024) The Complexity of Computing KKT Solutions of Quadratic Programs. In: ACM Symposium on Theory of Computing, 2024-6-24 - 2024-6-28.

Fearnley, John, Goldberg, Paul W, Hollender, Alexandros and Savani, Rahul ORCID: 0000-0003-1262-7831 (2021) The Complexity of Gradient Descent: CLS = PPAD ∧ PLS. STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, abs/20. pp. 46-59.

Fearnley, John, Goldberg, Paul, Hollender, Alexandros and Savani, Rahul ORCID: 0000-0003-1262-7831 (2023) The Complexity of Gradient Descent: CLS = PPAD ∧ PLS. JOURNAL OF THE ACM, 70 (1). pp. 1-74.

Fearnley, John and Savani, Rahul ORCID: 0000-0003-1262-7831 (2015) The Complexity of the Simplex Method. In: 47th annual ACM Symposium on Theory of Computing (STOC '15), 2015-6-14 - 2015-6-17.

Deligkas, Argyrios, Fearnley, John, Savani, Rahul ORCID: 0000-0003-1262-7831 and Spirakis, Paul ORCID: 0000-0001-5396-3749 (2017) Computing Approximate Nash Equilibria in Polymatrix Games. ALGORITHMICA, 77 (2). pp. 487-514.

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

Deligkas, Argyrios, Fearnley, John, Melissourgos, Themistoklis ORCID: 0000-0002-9867-6257 and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2019) Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem. Leibniz International Proceedings in Informatics, LIPIcs, 132.

Deligkas, Argyrios, Fearnley, John, Melissourgos, Themistoklis ORCID: 0000-0002-9867-6257 and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2021) Computing exact solutions of consensus halving and the Borsuk-Ulam theorem. In: ICALP 2019.

Deligkas, Argyrios, Fearnley, John, Hollender, Alexandros and Melissourgos, Themistoklis (2022) Constant Inapproximability for PPA. In: STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing.

Deligkas, Argyrios, Fearnley, John, Hollender, Alexandros and Melissourgos, Themistoklis (2022) Constant Inapproximability for PPA. [Preprint]

Fearnley, John, Rabe, Markus, Schewe, Sven ORCID: 0000-0002-9093-9518 and Zhang, Lijun (2010) Efficient Approximation of Optimal Control for Markov Games. CoRR.

Fearnley, John, Gordon, Spencer, Mehta, Ruta and Savani, Rahul ORCID: 0000-0003-1262-7831 (2018) End of Potential Line. .

Fearnley, John and Savani, Rahul ORCID: 0000-0003-1262-7831 (2021) A Faster Algorithm for Finding Tarski Fixed Points. 38TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2021), 187.

Fearnley, John, Palvolgyi, Domotor and Savani, Rahul ORCID: 0000-0003-1262-7831 (2022) A Faster Algorithm for Finding Tarski Fixed Points. ACM TRANSACTIONS ON ALGORITHMS, 18 (3). 29:1-29:1.

Fearnley, John, Pálvölgyi, Dömötör and Savani, Rahul ORCID: 0000-0003-1262-7831 (2022) A Faster Algorithm for Finding Tarski Fixed Points. ACM Transactions on Algorithms, 18 (3). pp. 1-23.

Disser, Yann, Fearnley, John, Gairing, M, Goebel, Oliver, Klimm, Max, Schmand, Daniel, Skopalik, Alexander and Toennis, Andreas (2020) Hiring Secretaries over Time: The Benefit of Concurrent Employment. Mathematics of Operations Research, 45 (1). pp. 323-352.

Amanatidis, Georgios, Christodoulou, George, Fearnley, John, Markakis, Evangelos, Psomas, Christos-Alexandros and Vakaliou, Eftychia (2018) An Improved Envy-Free Cake Cutting Protocol for Four Agents. In: 11th International Symposium on Algorithmic Game Theory, 2018-9-11 - 2018-9-14, Beijing, China.

Deligkas, Argyrios, Fearnley, John and Savani, Rahul ORCID: 0000-0003-1262-7831 (2016) Inapproximability Results for Approximate Nash Equilibria. .

Deligkas, Argyrios, Fearnley, John and Savani, Rahul ORCID: 0000-0003-1262-7831 (2016) Inapproximability Results for Approximate Nash Equilibria. In: WINE 2016: The 12th Conference on Web and Internet Economics.

Deligkas, Argyrios, Fearnley, John and Spirakis, Paul ORCID: 0000-0001-5396-3749 (2020) Lipschitz Continuity and Approximate Equilibria. In: Symposium on Algorithmic Game Theory (SAGT), 2016-9-19 - 2016-9-21, Liverpool UK.

Spooner, Thomas ORCID: 0000-0002-1732-7582, Fearnley, John, Savani, Rahul ORCID: 0000-0003-1262-7831 and Koukorinis, Andreas (2018) Market Making via Reinforcement Learning. .

Spooner, Thomas ORCID: 0000-0002-1732-7582, Fearnley, John, Savani, Rahul ORCID: 0000-0003-1262-7831 and Koukorinis, Andreas (2018) Market Making via Reinforcement Learning. In: AAMAS 2018.

Fearnley, John, Ibsen-Jensen, Rasmus and Savani, Rahul ORCID: 0000-0003-1262-7831 (2020) One-Clock Priced Timed Games are PSPACE-hard. LICS '20: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, abs/20. pp. 397-409.

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

Capponi, Simona ORCID: 0000-0002-2644-2312 (2023) Optimisation strategies for the design of experiments in materials discovery. PhD thesis, University of Liverpool.

Fearnley, John, Jain, Sanjay, Schewe, Sven ORCID: 0000-0002-9093-9518, Stephan, Frank and Wojtczak, Dominik ORCID: 0000-0001-5560-0546 (2017) An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space. In: ISSTA '17: International Symposium on Software Testing and Analysis.

Fearnley, John, Jain, Sanjay, Schewe, Sven ORCID: 0000-0002-9093-9518, Stephan, Frank and Wojtczak, Dominik ORCID: 0000-0001-5560-0546 (2017) An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space. CoRR, abs/17.

Fearnley, John and Zimmermann, Martin ORCID: 0000-0002-8038-2453 (2012) PLAYING MULLER GAMES IN A HURRY. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 23 (3). pp. 649-668.

Deligkas, Argyrios, Fearnley, John and Melissourgos, Themistoklis (2022) Pizza Sharing Is PPA-Hard. THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / THE TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 36 (5). pp. 4957-4965.

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

Fearnley, John and Zimmermann, Martin ORCID: 0000-0002-8038-2453 (2010) Playing Muller Games in a Hurry. .

Deligkas, Argyrios, Fearnley, John, Alexandros, Hollender and Themistoklis, Melissourgos (2022) Pure-Circuit: Strong Inapproximability for PPAD. In: FOCS 2022, 2022-10-31 - 2022-11-3.

Fearnley, John, Gairing, Martin, Mnich, Matthias and Savani, Rahul ORCID: 0000-0003-1262-7831 (2021) REACHABILITY SWITCHING GAMES. In: ICALP 2018.

Fearnley, John, Gairing, Martin, Mnich, Matthias and Savani, Rahul ORCID: 0000-0003-1262-7831 (2017) Reachability Switching Games. .

Deligkas, Argyrios, Fearnley, John, Hollender, Alexandros and Melissourgos, Themistoklis (2023) Tight Inapproximability for Graphical Games. In: AAAI 2023.

Deligkas, Argyrios, Fearnley, John and Savani, Rahul ORCID: 0000-0003-1262-7831 (2020) Tree Polymatrix Games Are PPAD-Hard. In: ICALP 2020.

Deligkas, Argyrios, Fearnley, John and Savani, Rahul ORCID: 0000-0003-1262-7831 (2020) Tree Polymatrix Games are PPAD-hard. In: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), 2020-7-8 - 2020-7-12, Beijing.

Fearnley, John, Gordon, Spencer, Mehta, Ruta and Savani, Rahul ORCID: 0000-0003-1262-7831 (2018) Unique End of Potential Line. .