activity
20082022
most citedPure Nash Equilibria in Concurrent Deterministic Games

48 citations · 241 across the 30 of their papers we have counts for

collaborators
Showing 2016Show all

7 papers · 1 filter

cs.CC2016

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…

cs.LO2016★ 1 cited

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…

cs.GT2016★ 4 cited

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…

cs.SE2016★ 1 cited

Proceedings Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters

Thomas Brihaye, Benoît Delahaye, Loïg Jezequel +2

This volume contains the joint proceedings of the Workshop on Games for the Synthesis of Complex Systems (CASSTING'16) and of the 3rd International Workshop on Synthesis of Complex…

eess.SY2016

Distributed Synthesis of State-Dependent Switching Control

Adrien Le Coënt, Laurent Fribourg, Nicolas Markey +2

We present a correct-by-design method of state-dependent control synthesis for linear discrete-time switching systems. Given an objective region R of the state space, the method bu…

cs.LO2016

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…