18 citations · 100 across the 28 of their papers we have counts for
4 papers · 1 filter
How to Play Optimally for Regular Objectives?
Patricia Bouyer, Nathanaël Fijalkow, Mickael Randour +1
This paper studies two-player zero-sum games played on graphs and makes contributions toward the following question: given an objective, how much memory is required to play optimal…
Timed Games with Bounded Window Parity Objectives
James C. A. Main, Mickael Randour, Jeremy Sproston
The window mechanism, introduced by Chatterjee et al. for mean-payoff and total-payoff objectives in two-player turn-based games on graphs, refines long-term objectives with time b…
Half-Positional Objectives Recognized by Deterministic Büchi Automata
Patricia Bouyer, Antonio Casares, Mickael Randour +1
In two-player games on graphs, the simplest possible strategies are those that can be implemented without any memory. These are called positional strategies. In this paper, we char…
Different Strokes in Randomised Strategies: Revisiting Kuhn's Theorem under Finite-Memory Assumptions
James C. A. Main, Mickael Randour
Two-player (antagonistic) games on (possibly stochastic) graphs are a prevalent model in theoretical computer science, notably as a framework for reactive synthesis. Optimal strate…