Szukana fraza: [Abstract = "We exploit these similarities in a common generalization of extensive games and Kripke structures that we name \"graph games\". By extending the Bellman\-Ford algorithm for computing shortest paths, we obtain a model\-checking algorithm for graph games with respect to formulas in an appropriate logic. Hence, when given a certain formula, our model\-checking algorithm computes the subgame\-perfect Nash equilibrium \(as opposed to simply determining whether or not a given collection of paths is a Nash equilibrium\)."]

Wyników: 1