Zero-Sum Game vs Sequential Game
Zero-Sum Game and Sequential Game are two Game Theory & Information concepts in AP Economics that students often mix up. A zero-sum game is a situation where one player's gain exactly equals another player's loss, so the total is unchanged. A sequential game is one where players move in turns and later movers see what came before, so it is drawn as a game tree and solved backward from the end. Here is how they compare side by side.
Poker among friends is roughly zero-sum: winnings equal losses. Many real economic interactions, like voluntary trade, are positive-sum (both gain), which is why framing economics as zero-sum is usually a mistake.
Because the second player observes the first player's move before choosing, a sequential game is drawn as a tree of decision nodes rather than a table. You solve it by backward induction: start at the last decision, pick the move that pays that player most, cross out the branches they would never take, then step back one node and repeat with those later choices treated as settled. The result is a path through the tree that no player wants to leave, which is why order of play can change the outcome completely. This is the difference from a simultaneous game shown in a payoff matrix, where neither side knows the other's move; here the first mover can act on the knowledge that their choice will be seen.
Zero-Sum vs Sequential: Two Independent Ways to Classify the Same Game
| Zero-Sum Game | Sequential Game | |
|---|---|---|
| What the label describes | The payoff structure: whether the combined total is fixed | The timing: who moves first and who gets to watch |
| Question it answers | Can both sides gain at the same time | Does a player see the rival's move before choosing |
| Natural format | Any format, since it is a property of payoffs rather than a display | A game tree, since flattening it into a table hides the timing |
| Solution method it points to | Strictly opposed interests, often settled with mixed strategies | Work back from the final decisions to the opening one |
| Effect of changing move order | Redistributes the fixed total and never enlarges it | Can change the equilibrium outcome altogether |
| Who tends to gain from the order | The second mover, who can exploit what was revealed | Often the first mover, who can commit and be reacted to |
| A pure example | Two players splitting a prize of fixed size | A market leader setting capacity before a follower responds |
The two labels sit on different axes, so all four combinations exist
Students often memorise one list of game types, which makes these two words look like alternatives on the same menu. They are not. One describes what the payoffs add up to and the other describes the order of play, so a game can be zero-sum and simultaneous, zero-sum and sequential, neither, or both. Two firms simultaneously splitting a fixed market are zero-sum and simultaneous. Chess is zero-sum and sequential. The prisoner's dilemma is simultaneous and not zero-sum, since mutual cooperation beats mutual defection for both players. A leader firm choosing capacity before a follower reacts is sequential and not zero-sum, because industry profit rises or falls with what the two of them pick. Knowing one label tells you nothing whatever about the other. The payoff is that each label points at a different tool. Zero-sum tells you to stop hunting for a mutually preferred outcome, since none exists, and to expect randomisation when no pure equilibrium survives. Sequential tells you to draw a tree instead of a grid and to reason from the last decisions backwards. Questions frequently need both moves, and the classic symptom of confusing the axes is a student drawing a matrix for a game whose entire point is that one player commits first.
Move order can hand the whole prize to the second mover without creating anything
Matching pennies makes the point sharply. Two players each show heads or tails, the matcher wins 1 when the faces agree and loses 1 when they differ, and the rival's payoff is the exact opposite, so every cell sums to zero. Played simultaneously, neither player has a pure best choice, both randomise evenly, and each expects zero. Now let the matcher move second and watch. The matcher copies whatever appeared and wins 1 every single round, while the first mover loses 1 every round. Move order transferred the entire value of the game and created none of it, because the total was pinned at zero throughout. Compare a game that is not zero-sum. Two firms choose between rival technical standards; coordinating on the first pays 30 to one firm and 20 to the other, coordinating on the second reverses those, and disagreeing pays both nothing. Played simultaneously with no way to coordinate, the mixed equilibrium leaves each firm expecting 12, so 24 combined. Let one firm choose first and the other simply matches it, giving 30 and 20, so 50 combined. There the order genuinely created value. Which is why first-mover advantage is a claim about the payoff structure, not about sequencing by itself.
Frequently asked questions
Is a sequential game always zero-sum?
No. The two labels are independent of each other. Chess is sequential and zero-sum, while a leader firm choosing output before a follower reacts is sequential and not zero-sum, since industry profit changes with their choices. Test the payoff structure by adding the payoffs at each outcome, and test the timing by asking whether a player observes a rival's move before choosing. Neither answer constrains the other.
Who has the advantage in a sequential zero-sum game?
Usually the player who moves second, because in a strictly opposed contest, observing a rival's choice can only help and being observed can only hurt. Matching pennies is the clean case, since the observer wins every round. First-mover advantage shows up when committing early changes the rival's best response in a direction that happens to help you, and that needs interests which are not perfectly opposed. See /glossary/first-mover-advantage.
Can you put a sequential game into a payoff matrix?
You can, by treating each player's complete plan of action as a single strategy, but the table then hides what made the game sequential. Move order and what the second player observed both disappear, and the grid will happily display equilibria resting on threats that fall apart the moment you draw the tree. Use a tree whenever the question turns on timing or credibility. See /glossary/payoff-matrix.
Related comparisons
Get AP Econ exam tips in your inbox
Occasional emails with study tips, new interactive graphs, and exam-season reminders. Free, no spam.
No spam. Unsubscribe anytime. Read our privacy policy.
Keep track of what you have studied
A free EconLearn account adds progress tracking, your quiz history, and achievements. Studying here is free either way, and there is nothing to pay for as a student.
Create a free accountAlready have one? Sign in
Last updated