\(T\) is a tree describing the temporal structure of the game situation: Formally, \(T\) consists of a set of nodes and an immediate successor relation \(\rightarrowtail\). Let \(Z\) denote the set of terminal nodes (i.e., nodes without any successors) and \(V\) the remaining nodes (called decision nodes). Let \(v_0\) denote the initial node (i.e., the root of the tree). The edges at a decision node \(v\in V\) are each labeled with actions from a set \(Act\). Let \(Act(v)\) denote the set of actions available at \(v\). Let \(\rightsquigarrow\) be the transitive closure of \(\rightarrowtail\).