3 results
Patricia Bouyer ; Thomas Brihaye ; Fabrice Chevalier.
In this paper, we consider reachability games over general hybrid systems, and distinguish between two possible observation frameworks for those games: either the precise dynamics of the system is seen by the players (this is the perfect observation framework), or only the starting point and the […]
Published on January 12, 2010
Patricia Bouyer ; Youssouf Oualhadj ; Mickael Randour ; Pierre Vandenhove.
We study stochastic zero-sum games on graphs, which are prevalent tools to model decision-making in presence of an antagonistic opponent in a random environment. In this setting, an important question is the one of strategy complexity: what kinds of strategies are sufficient or required to play […]
Published on December 1, 2023
Patricia Bouyer ; Antonio Casares ; Mickael Randour ; Pierre Vandenhove.
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 characterize objectives recognizable by deterministic B\"uchi automata (a subclass of omega-regular objectives) that are […]
Published on August 29, 2024