activity
20122020
most citedSimple Priced Timed Games Are Not That Simple

7 citations · 17 across the 5 of their papers we have counts for

collaborators

6 papers

cs.GT2020★ 1 cited

One-Clock Priced Timed Games with Negative Weights

Thomas Brihaye, Gilles Geeraerts, Axel Haddad +2

Priced timed games are two-player zero-sum games played on priced timed automata (whose locations and transitions are labeled by weights modelling the cost of spending time in a st…

cs.GT2016★ 3 cited

Efficient Energy Distribution in a Smart Grid using Multi-Player Games

Thomas Brihaye, Amit Kumar Dhar, Gilles Geeraerts +2

Algorithms and models based on game theory have nowadays become prominent techniques for the design of digital controllers for critical systems. Indeed, such techniques enable auto…

cs.GT2015★ 7 cited

Simple Priced Timed Games Are Not That Simple

Thomas Brihaye, Gilles Geeraerts, Axel Haddad +2

Priced timed games are two-player zero-sum games played on priced timed automata (whose locations and transitions are labeled by weights modeling the costs of spending time in a st…

cs.GT2015

Quantitative Games under Failures

Thomas Brihaye, Gilles Geeraerts, Axel Haddad +3

We study a generalisation of sabotage games, a model of dynamic network games introduced by van Benthem. The original definition of the game is inherently finite and therefore does…

cs.GT2014

To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games

Thomas Brihaye, Gilles Geeraerts, Axel Haddad +1

Quantitative games are two-player zero-sum games played on directed weighted graphs. Total-payoff games (that can be seen as a refinement of the well-studied mean-payoff games) are…

cs.LO2012★ 6 cited

IO vs OI in Higher-Order Recursion Schemes

Axel Haddad

We propose a study of the modes of derivation of higher-order recursion schemes, proving that value trees obtained from schemes using innermost-outermost derivations (IO) are the s…