Arena-Independent Finite-Memory Determinacy in Stochastic Games

no code implementations • 19 Feb 2021 • Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove

Second, we show that we can reduce the study of objectives for which pure AIFM strategies suffice in two-player stochastic games to the easier study of one-player stochastic games (i. e., Markov decision processes).

Decision Making Computer Science and Game Theory Formal Languages and Automata Theory Logic in Computer Science

Games Where You Can Play Optimally with Arena-Independent Finite Memory

no code implementations • 12 Jan 2020 • Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove

In 2005, Gimbert and Zielonka provided a complete characterization of preference relations (a formal framework to model specifications and game objectives) that admit memoryless optimal strategies for both players.

Computer Science and Game Theory Formal Languages and Automata Theory Logic in Computer Science