Full list of components: 1. A set of players (I) 2. An ordering of play (T ) (a) We specify an order of play by de ning a game tree T . (b) We also require that each node has exactly one immediate predecessor, in order for each node to be a complete description of the path preceding it 3. Payo s as a function of moves (ui) (a) Let a terminal node be a node that is not a predecessor of any node. Denote the set of such nodes by Z. (b) By the condition imposed above of unique predecessors, every terminal node corresponds to a unique complete path history.