Let G be a finite extensive form game with perfect information and chance moves, referred to here as a game. Fix a set of players N = {1, 2, ..., n} and a set of histories H, such that the root history ∅ ∈ H and, for any a = (a1, ..., at−1, at) ∈ H, (a1, ..., at−1) ∈ H. The set of terminal histories is Z ⊂ H, and the player assignment function identifies a subset of players (or Nature) at each ...