27 citations · 79 across the 13 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2012★ 27 cited
On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games
Thomas Brihaye, Véronique Bruyère, Julie De Pril +1
We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set o…
cs.GT2008★ 8 cited
Algorithms for Game Metrics
Krishnendu Chatterjee, Luca de Alfaro, Rupak Majumdar +1
Simulation and bisimulation metrics for stochastic systems provide a quantitative generalization of the classical simulation and bisimulation relations. These metrics capture the s…