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

Abstract

Abstract. 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.

Admissible Strategies in Timed Games

“…The only works that we are aware of and that consider non-zero sum timed games are the following two papers [8,9] that study decision problems related to the concept of Nash equilibria and not to the concept of admissibility.…”