1 citations · 1 across the 6 of their papers we have counts for
4 papers · 1 filter
Infinite lexicographic products of positional objectives
Antonio Casares, Pierre Ohlmann, MichaÅ Skrzypczak +1
This paper contributes to the study of positional determinacy of infinite duration games played on potentially infinite graphs with neutral transitions. Recently, [Ohlmann, Theoret…
A symmetric recursive algorithm for mean-payoff games
Pierre Ohlmann
We propose a new deterministic symmetric recursive algorithm for solving mean-payoff games.
Games on Graphs: From Logic and Automata to Algorithms
Nathanaël Fijalkow, C. Aiswarya, Guy Avni +22
The objective of this book is to give a comprehensive presentation of the research field concerned with infinite duration games on graphs. Historically, these game models appeared…
Fast value iteration: A uniform approach to efficient algorithms for energy games
Michaël Cadilhac, Antonio Casares, Pierre Ohlmann
We study algorithms for solving parity, mean-payoff and energy games. We propose a systematic framework, which we call Fast value iteration, for describing, comparing, and proving…