10 citations · 10 across the 3 of their papers we have counts for
6 papers
Reach together: How populations win repeated games
Nathalie Bertrand, Patricia Bouyer, Luc Lapointe +1
In repeated games, players choose actions concurrently at each step. We consider a parameterized setting of repeated games in which the players form a population of an arbitrary si…
Antichains for Concurrent Parameterized Games (Long Version)
Nathalie Bertrand, Patricia Bouyer, Gaëtan Staquet
Concurrent parameterized games involve a fixed yet arbitrary number of players. They are described by finite arenas in which the edges are labeled with languages that describe the…
Beyond Decisiveness of Infinite Markov Chains
Benoît Barbot, Patricia Bouyer, Serge Haddad
Verification of infinite-state Markov chains is still a challenge despite several fruitful numerical or statistical approaches. For decisive Markov chains, there is a simple numeri…
From Local To Global Optimality in Concurrent Parity Games
Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux
We study two-player games on finite graphs. Turn-based games have many nice properties, but concurrent games are harder to tame: e.g. turn-based stochastic parity games have positi…
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…
Decisiveness for countable MDPs and insights for NPLCSs and POMDPs
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye +2
Markov chains and Markov decision processes (MDPs) are well-established probabilistic models. While finite Markov models are well-understood, analysing their infinite counterparts…