Computing Equilibria in Two-Player Timed Games via Turn-Based Finite Games

We study two-player timed games where the objectives of the two players are not opposite. We focus on the standard notion of Nash equilibrium and propose a series of transformations that builds two finite turn-based games out of a timed game, with a precise correspondence between Nash equilibria in the original and in final games. This provides us with an algorithm to compute Nash equilibria in two-player timed games for large classes of properties.

• Type: Journal
• Year: 2010
• Where: FORMATS
• Authors: Patricia Bouyer, Romain Brenguier, Nicolas Markey
• Keywords: Formal Methods, FORMATS 2010, Nash Equilibria, Timed Games, Two-player Timed Games