Search Results - "Fearnley, John"

Reachability Switching Games by John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani

“…We study the problem of deciding the winner of reachability switching games for zero-, one-, and two-player variants. Switching games provide a deterministic…”
Get full text

The Complexity of All-switches Strategy Improvement by John Fearnley, Rahul Savani

“…Strategy improvement is a widely-used and well-studied class of algorithms for solving graph-based infinite games. These algorithms are parameterized by a…”
Get full text

Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width by Fearnley, John, Schewe, Sven

“…Parity games are a much researched class of games in NP intersect CoNP that are not known to be in P. Consequently, researchers have considered specialised…”
Get full text

Playing Muller Games in a Hurry by Fearnley, John, Zimmermann, Martin

“…This work studies the following question: can plays in a Muller game be stopped after a finite number of moves and a winner be declared. A criterion to do this…”
Get full text

Unique end of potential line by Fearnley, John, Gordon, Spencer, Mehta, Ruta, Savani, Rahul

“…The complexity class CLS was proposed by Daskalakis and Papadimitriou in 2011 to understand the complexity of important NP search problems that admit both path…”
Get full text

Computing exact solutions of consensus halving and the Borsuk-Ulam theorem by Deligkas, Argyrios, Fearnley, John, Melissourgos, Themistoklis, Spirakis, Paul G.

“…We study the problem of finding an exact solution to the Consensus Halving problem. While recent work has shown that the approximate version of this problem is…”
Get full text

Approximating the existential theory of the reals by Deligkas, Argyrios, Fearnley, John, Melissourgos, Themistoklis, Spirakis, Paul G.

“…The Existential Theory of the Reals (ETR) consists of existentially quantified Boolean formulas over equalities and inequalities of polynomial functions of…”
Get full text

Reachability in two-clock timed automata is PSPACE-complete by Fearnley, John, Jurdziński, Marcin

“…Recently, Haase, Ouaknine, and Worrell have shown that reachability in two-clock timed automata is log-space equivalent to reachability in bounded one-counter…”
Get full text

Pure-Circuit: Strong Inapproximability for PPAD by Deligkas, Argyrios, Fearnley, John, Hollender, Alexandros, Melissourgos, Themistoklis

“…The current state-of-the-art methods for showing inapproximability in PPAD arise from the \varepsilon-Generalized-Circuit (\varepsilon-GCIRCUIT) problem…”
Get full text

Computing Approximate Nash Equilibria in Polymatrix Games by Deligkas, Argyrios, Fearnley, John, Savani, Rahul, Spirakis, Paul

“…In an ϵ -Nash equilibrium, a player can gain at most ϵ by unilaterally changing his behavior. For two-player (bimatrix) games with payoffs in [0, 1], the…”
Get full text

Lipschitz Continuity and Approximate Equilibria by Deligkas, Argyrios, Fearnley, John, Spirakis, Paul

“…In this paper, we study games with continuous action spaces and non-linear payoff functions. Our key insight is that Lipschitz continuity of the payoff…”
Get full text

Bayesian optimisation of restriction zones for bluetongue control by Spooner, Thomas, Jones, Anne E., Fearnley, John, Savani, Rahul, Turner, Joanne, Baylis, Matthew

“…We investigate the restriction of animal movements as a method to control the spread of bluetongue, an infectious disease of livestock that is becoming…”
Get full text

An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space by Fearnley, John, Jain, Sanjay, de Keijzer, Bart, Schewe, Sven, Stephan, Frank, Wojtczak, Dominik

“…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…”
Get full text

Distributed Methods for Computing Approximate Equilibria by Czumaj, Artur, Deligkas, Argyrios, Fasoulakis, Michail, Fearnley, John, Jurdziński, Marcin, Savani, Rahul

“…We present a new, distributed method to compute approximate Nash equilibria in bimatrix games. In contrast to previous approaches that analyze the two payoff…”
Get full text

Synthesis of succinct systems by Fearnley, John, Peled, Doron, Schewe, Sven

“…Synthesis of correct by design systems from specifications has recently attracted a lot of attention. The theoretical results imply that this problem is highly…”
Get full text

Efficient approximation of optimal control for continuous-time Markov games by Fearnley, John, Rabe, Markus N., Schewe, Sven, Zhang, Lijun

“…We study the time-bounded reachability problem for continuous-time Markov decision processes (CTMDPs) and games (CTMGs). Existing techniques for this problem…”
Get full text

Approximate Well-supported Nash Equilibria Below Two-thirds by Fearnley, John, Goldberg, Paul W., Savani, Rahul, Sørensen, Troels Bjerre

“…In an ϵ -Nash equilibrium, a player can gain at most ϵ by changing his behaviour. Recent work has addressed the question of how best to compute ϵ -Nash…”
Get full text

Super Unique Tarski is in UEOPL by Fearnley, John, Savani, Rahul

“…We define the Super-Unique-Tarski problem, which is a Tarski instance in which all slices are required to have a unique fixed point. We show that…”
Get full text

Efficient Parallel Strategy Improvement for Parity Games by Fearnley, John

“…We study strategy improvement algorithms for solving parity games. While these algorithms are known to solve parity games using a very small number of…”
Get full text

Pure-Circuit: Tight Inapproximability for PPAD by Deligkas, Argyrios, Fearnley, John, Hollender, Alexandros, Melissourgos, Themistoklis

“…The current state-of-the-art methods for showing inapproximability in PPAD arise from the $\varepsilon$-Generalized-Circuit ($\varepsilon$-GCircuit) problem…”
Get full text