60 citations
- Université Paris-SaclayFR43 papers
- Centre National de la Recherche ScientifiqueFR36 papers
- CentraleSupélecFR17 papers
- Institut national de recherche en sciences et technologies du numériqueFR14 papers
- École Normale Supérieure - PSLFR11 papers
- École Normale Supérieure Paris-SaclayFR8 papers
- Laboratoire de Biologie et Pharmacologie AppliquéeFR8 papers
- Laboratoire Lorrain de Recherche en Informatique et ses ApplicationsFR8 papers
- Centre Inria de SaclayFR6 papers
- Institut Universitaire de FranceFR6 papers
- Université de LorraineFR6 papers
- Aix-Marseille UniversitéFR5 papers
5 papers · 1 filter
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…
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…
Playing (Almost-)Optimally in Concurrent Büchi and co-Büchi Games
Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux
We study two-player concurrent stochastic games on finite graphs, with Büchi and co-Büchi objectives. The goal of the first player is to maximize the probability of satisfying the…
Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs
Patricia Bouyer, Mickael Randour, Pierre Vandenhove
We consider zero-sum games on infinite graphs, with objectives specified as sets of infinite words over some alphabet of colors. A well-studied class of objectives is the one of $ω…
Games Where You Can Play Optimally with Arena-Independent Finite Memory
Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj +2
For decades, two-player (antagonistic) games on graphs have been a framework of choice for many important problems in theoretical computer science. A notorious one is controller sy…