52 citations · 142 across the 23 of their papers we have counts for
3 papers · 1 filter
Reaching as Cheap as Possible in 1-clock Robust Weighted Timed Games
Nathalie Bertrand, Maëlle Gautrin, Julie Parreaux
The value problem for 2-player games on graph generally consists in determining the minimal value Min can ensure against any possible strategy for Max. We consider here the value p…
Dynamic network congestion games
Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan +1
Congestion games are a classical type of games studied in game theory, in which n players choose a resource, and their individual cost increases with the number of other players ch…
Determinacy and Decidability of Reachability Games with Partial Observation on Both Sides
Nathalie Bertrand, Blaise Genest, Hugo Gimbert
We prove two determinacy and decidability results about two-players stochastic reachability games with partial observation on both sides and finitely many states, signals and actio…