7QQMM200 Chap.6 Game Trees, Information Sets and Strategies
Game Trees, Information Sets and Strategies
Represent strategic timing
An extensive-form game records players, actions, move order, information, terminal outcomes and any moves by Nature. A path is a realised history, while a strategy specifies an action at every information set that belongs to the player.
Information changes the strategy space
Singleton information sets permit conditioning on the observed node.
Linked nodes remove that distinction and require one action across the set. Complete and perfect information describe different features, so observability should not be confused with common knowledge of payoffs and structure.
Build the tree in a fixed order
Place the initial mover at the root, draw one branch for each available action and continue until every history ends at a terminal node.
Attach payoff tuples only after declaring player order. A repeated physical outcome reached through different histories may need separate nodes because the information and incentives that led there can differ.
Encode what each player knows
A singleton information set means the mover identifies the exact node.
Linking nodes means the mover cannot tell which history occurred and must choose the same action across them. The nodes must offer identical action sets. A simultaneous move can therefore be drawn sequentially only when the later mover's nodes are linked to remove observation of the earlier action.
Count strategies from information sets
A pure strategy chooses one action at each of a player's information sets.
Multiply the numbers of available actions across independent sets to obtain the strategy count. Counting nodes instead will overstate strategies when several nodes are linked.
Retain instructions at unreached sets because they influence whether earlier actions are profitable and later threats credible.
Compare representations for strategic equivalence
Two drawings can depict the same game when players, actions, information and payoffs generate the same contingent plans. A different visual order is not decisive.
By contrast, adding observation or changing tuple order alters the strategic situation. Before solving equilibrium, verify branch labels, terminal payoffs, information links and the completeness of each strategy list.
Translate a tree into complete contingent plans
List a player's information sets in a fixed order and form one strategy by selecting an action at each set.
With two actions at each of two independent information sets, that player has four pure strategies, even when a particular path reaches only one set. For linked nodes, record one shared instruction rather than one action per node.
This construction makes the normal-form rows and columns auditable and prevents an outcome path from being mistaken for a strategy.
Audit information before solving incentives
Ask at every decision whether the mover observes all earlier actions relevant to distinguishing the current node. If not, the appropriate nodes belong to one information set and must offer matching actions.
Check that no information set links nodes belonging to different players or allows one node to precede another within the same set. Only after this audit should payoff comparisons begin. Otherwise an equilibrium calculation may be internally correct for a different game created accidentally by the drawing.
What this chapter covers
- 01
Root node
- 02
Terminal node
- 03
Ordered payoff
- 04
Information set
- 05
Perfect information
- 06
Contingent strategy
Worked example · free
Read a two-stage entry tree
- 2State the payoff order as A then B.
- 3List A's root choices and B's contingent actions.
- 3Compare B's payoffs 2 and 4 after entry.
Key terms
- Game Tree
- A Game Tree represents ordered moves, available actions and terminal outcomes.
- Terminal Node
- A Terminal Node ends a history and carries the associated payoff tuple.
- Information Set
- An Information Set states which decision nodes a player can distinguish when moving.
Game Trees, Information Sets and Strategies FAQ
What must an extensive-form description include?
It needs the players, payoff functions, order of moves, available actions, information at each decision and any probability distribution governing moves by Nature within the model.
How do linked nodes affect strategies?
Nodes in one information set are indistinguishable to the mover. The same action options must exist at each node, and a pure strategy assigns one common action across the set.
Why include actions at unreached nodes?
A strategy is a complete plan, so off-path instructions affect incentives and equilibrium credibility even though the realised history visits only one sequence of nodes.
Exam move
Redraw small games from verbal descriptions. Declare tuple order, circle information sets and count pure strategies as combinations of actions across those sets. Convert one tree to normal form to confirm that off-path actions have not disappeared.
Working through Game Trees, Information Sets and Strategies in 7QQMM200? Sia is AskSia’s AI Economics tutor — ask any 7QQMM200 Game Trees, Information Sets and Strategies question and get a clear, step-by-step explanation grounded in how 7QQMM200 is taught and assessed. Read this chapter free, then take your hardest questions to Sia.