• Publications
  • Influence
Reachability in Two-Clock Timed Automata is PSPACE-complete
Abstract Recently, Haase, Ouaknine, and Worrell have shown that reachability in two-clock timed automata is log-space equivalent to reachability in bounded one-counter automata. We show thatExpand
  • 45
  • 9
Exponential Lower Bounds for Policy Iteration
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. WeExpand
  • 79
  • 7
Non-oblivious Strategy Improvement
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 strategyExpand
  • 22
  • 5
An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space
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 theirExpand
  • 17
  • 5
The Complexity of the Simplex Method
The simplex method is a well-studied and widely-used pivoting method for solving linear programs. When Dantzig originally formulated the simplex method, he gave a natural pivot rule that pivots intoExpand
  • 28
  • 4
An ordered approach to solving parity games in quasi polynomial time and quasi linear space
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 theirExpand
  • 41
  • 3
Time and Parallelizability Results for Parity Games with Bounded Treewidth
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 graphExpand
  • 12
  • 3
Computing Approximate Nash Equilibria in Polymatrix Games
In an $$\epsilon $$ϵ-Nash equilibrium, a player can gain at most $$\epsilon $$ϵ by unilaterally changing his behavior. For two-player (bimatrix) games with payoffs in [0, 1], the best-knownExpand
  • 22
  • 2
Finding Approximate Nash Equilibria of Bimatrix Games via Payoff Queries
We study the deterministic and randomized query complexity of finding approximate equilibria in a k × k bimatrix game. We show that the deterministic query complexity of finding an ϵ-Nash equilibriumExpand
  • 15
  • 2
Learning equilibria of games via payoff queries
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-strategyExpand
  • 44
  • 1