23 citations · 48 across the 17 of their papers we have counts for
Showing 2014 · cs.GTShow all
2 papers · 2 filters
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.GT2014★ 1 cited
Adding Negative Prices to Priced Timed Games
Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna +3
Priced timed games (PTGs) are two-player zero-sum games played on the infinite graph of configurations of priced timed automata where two players take turns to choose transitions i…