52 citations · 269 across the 38 of their papers we have counts for
7 papers · 1 filter
Dynamic Complexity of Parity Games with Bounded Tree-Width
Patricia Bouyer, Vincent Jugé, Nicolas Markey
Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of two-player parity games over graphs of…
Bounding Average-energy Games
Patricia Bouyer, Piotr Hofman, Nicolas Markey +2
We consider average-energy games, where the goal is to minimize the long-run average of the accumulated energy. While several results have been obtained on these games recently, de…
Dynamic Complexity of the Dyck Reachability
Patricia Bouyer, Vincent Jugé
Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of Dyck reachability problems in directed…
Stochastic Equilibria under Imprecise Deviations in Terminal-Reward Concurrent Games
Patricia Bouyer, Nicolas Markey, Daniel Stan
We study the existence of mixed-strategy equilibria in concurrent games played on graphs. While existence is guaranteed with safety objectives for each player, Nash equilibria need…
Stochastic Timed Games Revisited
S Akshay, Patricia Bouyer, Shankara Narayanan Krishna +2
Stochastic timed games (STGs), introduced by Bouyer and Forejt, naturally generalize both continuous-time Markov chains and timed automata by providing a partition of the locations…
Reachability in Networks of Register Protocols under Stochastic Schedulers
Patricia Bouyer, Nicolas Markey, Mickael Randour +2
We study the almost-sure reachability problem in a distributed system obtained as the asynchronous composition of N copies (called processes) of the same automaton (called protocol…