Filter Results:
- Full text PDF available (25)
Publication Year
2010
2018
- This year (6)
- Last 5 years (29)
- Last 10 years (42)
Publication Type
Co-author
Journals and Conferences
Learn More
- John Fearnley
- ICALP
- 2010
We study policy iteration for infinite-horizon Markov decision processes. It has recently been shown policy iteration style algorithms have exponential lower bounds in a two player game setting. We… (More)
- John Fearnley, Marcin Jurdzinski
- Inf. Comput.
- 2015
- John Fearnley
- LPAR
- 2010
We study strategy improvement algorithms for mean-payoff and parity games. We describe a structural property of these games, and we show that these structures can affect the behaviour of strategy… (More)
- John Fearnley, Sanjay Jain, Sven Schewe, Frank Stephan, Dominik Wojtczak
- SPIN
- 2017
Parity games play an important role in model checking and synthesis. In their paper, Calude et al. have recently shown that these games can be solved in quasi-polynomial time. We show that their… (More)
- John Fearnley, Markus N. Rabe, Sven Schewe, Lijun Zhang
- FSTTCS
- 2011
- John Fearnley, Sven Schewe
- 2011
Parity games are a much researched class of games in NP ∩ CoNP that are not known to be in P. Consequently, researchers have considered specialised algorithms for the case where certain graph… (More)
A recent body of experimental literature has studied empirical game-theoretical analysis, in which we have partial knowledge of a game, consisting of observations of a subset of the pure-strategy… (More)
- Nathalie Bertrand, John Fearnley, Sven Schewe
- CSL
- 2012
While model checking PCTL for Markov chains is decidable in polynomial-time, the decidability of PCTL satisfiability, as well as its finite model property, are long standing open problems. While… (More)
- John Fearnley
- CAV
- 2017
We study strategy improvement algorithms for solving parity games. While these algorithms are known to solve parity games using a very small number of iterations, experimental studies have found that… (More)