John Fearnley

Preprints

• Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width. [Download]
  J. Fearnley and S. Schewe.

Conference Publications

• Reachability in Two-Clock Timed Automata is PSPACE-complete. [Download]
  J. Fearnley and M. Jurdziński.
  International Colloquium on Automata, Languages and Programming (ICALP), 2013.
• Learning Equilibria of Games via Payoff Queries. [Download]
  J. Fearnley, M. Gairing, P. W. Goldberg, and R. Savani.
  ACM Conference on Electronic Commerce (EC), 2013.
• Approximate Well-supported Nash Equilibria below Two-thirds. [Download]
  J. Fearnley, P. W. Goldberg, R. Savani, and T. B. Sørensen.
  International Symposium on Algorithmic Game Theory (SAGT), 2012.
• Synthesis of Succinct Systems. [Download]
  J. Fearnley, D. A. Peled, and S. Schewe.
  International Symposium on Automated Technology for Verification and Analysis (ATVA), 2012.
• Bounded Satisfiability for PCTL. [Download]
  N. Bertrand, J. Fearnley, and S. Schewe.
  Conference on Computer Science Logic (CSL), 2012.
• Time and Parallelizability Results for Parity Games with Bounded Treewidth. [Download]
  J. Fearnley and S. Schewe.
  International Colloquium on Automata, Languages and Programming (ICALP), 2012.
• Efficient Approximation of Optimal Control for Continuous-Time Markov Games. [Download]
  J. Fearnley, M. Rabe, S. Schewe, and L. Zhang.
  Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2011.
• Parity Games On Graphs With Medium Tree-width. [Download]
  J. Fearnley and O. Lachish.
  International Symposium on Mathematical Foundations of Computer Science (MFCS), 2011.
• Playing Muller Games in a Hurry. [Download]
  J. Fearnley and M. Zimmermann.
  International Symposium on Games, Automata, Logics and Formal Verification (GANDALF), 2010.
• Exponential Lower Bounds for Policy Iteration. [Download]
  J. Fearnley.
  International Colloquium on Automata, Languages and Programming (ICALP), 2010.
• Non-oblivious Strategy Improvement. [Download]
  J. Fearnley.
  International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR), 2010.
• Linear Complementarity Algorithms for Infinite Games. [Download]
  J. Fearnley, M. Jurdziński, and R. Savani.
  International Conference on Current Trends in Theory & Practice of Computer Science (SOFSEM), 2010.

Journal Publications

• Playing Muller Games in a Hurry. [Download]
  J. Fearnley and M. Zimmermann.
  International Journal of Foundations of Computer Science. 23(3) pp. 649-668.

Thesis

• J. Fearnley. Strategy iteration algorithms for games and Markov decision processes. PhD thesis, University of Warwick, 2010.

Contact Details

Email: john.fearnley@liverpool.ac.uk
Office: Room 1.17