Normal form game (NFG) A (finite, $n$-person) normal form game is a tuple N = $(N, A, u)$, where: $N = {1, …, n}$ is a finite set of players; $A = A_1 \times…\times A_n$ and
What is Stackelberg Game A Stackelberg Game is a type of game in which there are two players: the Leader and the Follower. The Leader moves first and chooses a strategy, denoted by π. The Foll...
LTL v.s. Buchi Automata Buchi automata are more expressive than LTL For every LTL formula, an NBA can be constructed LTL v.s. Omega-regular Language LTL formulae describe omega-regular LT...
Basic Game Theory for Automatic Verification
Data Visualisation -- Theories
A new version of content is available.
