John Fearnley

Dr John Fearnley serves as a Lecturer in the Department of Computer Science within the School of Engineering and Physical Sciences. He actively coordinates undergraduate modules including Automated Trading Project (COMP396) and Programming Language Paradigms (COMP105), demonstrating core teaching responsibilities in theoretical computer science.

His research focuses on Algorithmic Game Theory, Verification, and Computational Complexity, with particular emphasis on equilibrium computation, fixed-point problems, and complexity barriers in economic models. Recent work investigates inapproximability results for PPAD/PPA complexity classes and structural properties of monotone contractions.

Analysis of his 2024-2025 publications reveals consistent exploration of computational boundaries in game-theoretic models, with co-authored works appearing in premier venues like STOC and SIAM Journal on Computing. Key themes include tight inapproximability for market equilibria, structural analysis of linear complementarity problems, and complexity-theoretic barriers in fixed-point computation.

• ENGINEERING & PHYSICAL SCIENCES RESEARCH COUNCIL: New Techniques for Resolving Boundary Problems in Total Search (Jan 2023 - Dec 2025)
• ENGINEERING & PHYSICAL SCIENCES RESEARCH COUNCIL: Solving Parity Games in Theory and Practice (Aug 2017 - Sep 2021)

Dr Fearnley supervises advanced research projects including doctoral theses on optimization strategies for materials discovery experiments, while maintaining active collaborations with leading researchers in computational economics and theoretical computer science.