Skip to content
Economics & Markets

Game Theory: Combinatorial

Model #0688Category: Economics & MarketsDepth to apply:

By Updated 3 sources

4 min read
Economics & Markets
Section 1

Core Idea

Combinatorial game theory studies games with a finite set of positions, perfect information, and no chance — e.g. chess, go, nim. The key idea: under certain conditions, the game has a determinate outcome (win, loss, or draw) and optimal strategies can be computed. It's less about negotiation and more about sequential moves and backward induction. For founders, the link is to any setting where moves are discrete, information is complete, and you can reason backward from the end state — auctions, some negotiations, or multi-stage competitions. When the structure is combinatorial, invest in working out the tree.

Get Faster Than Normal by email

Ideas from founders and companies.

Free newsletter. Unsubscribe anytime.

Or open the full subscribe page.

Section 2

How to See It

Strategy
You're seeing Combinatorial Game Theory when a competitive or deal situation has a clear sequence of moves, full information, and no randomness. You can map a tree and ask "if they do X, we do Y."
Auctions
You're seeing it when bidding or allocation rules are fixed and outcomes depend only on who moves when and what they choose. Optimal bids can sometimes be derived from the structure.
Product
You're seeing it when feature or roadmap choices are sequential and visible — competitors and customers can reason about your next move. The "game" has a combinatorial flavour even if not fully formal.
Section 3

How to Use It

When the situation is finite, sequential, and deterministic, sketch the move tree. Work backward from terminal outcomes to find best responses. Use that to decide your first move or to spot when the other side has a winning strategy. If the game is too large to solve, use heuristics (e.g. control the center, limit options) borrowed from combinatorial games.
Decision filter
"Can we list the moves and work backward from the end? If yes, we're in a combinatorial setting — solve or approximate the tree before committing."
As a founder
In structured negotiations or multi-round processes (e.g. M&A, procurement), map the stages and decision points. Identify who moves when and what information they have. Use backward induction to choose your opening and responses.
Section 5

Founders & Leaders

Satya NadellaCEO, Microsoft
Nadella has framed strategic moves in platform and cloud as multi-move games with visible plays (open source, partnerships, pricing). Founders can adopt the discipline: when the competitive structure is sequential and knowable, reason backward from desired end states and choose moves that force favourable branches.
Section 7

Connected Models

Reinforces
Game Theory
Combinatorial game theory is a branch of game theory: same framework of players, strategies, and payoffs, but with finite positions, perfect information, and no chance. The solution concept is often "solved" or equilibrium in the tree.
Reinforces
Nash [Equilibrium](/mental-models/equilibrium)
In combinatorial games, equilibrium is often a saddle point or a solved outcome (e.g. white wins). Nash equilibrium in the extensive form is the same idea: no player gains by unilaterally changing strategy given the tree.
Leads-to
Mechanism Design
Mechanism design inverts the problem: given desired outcomes, what rules (auction, contract) implement them? Combinatorial structure often appears in the design of such mechanisms (e.g. matching, sequencing).
Section 8

One Key Quote

"In a game with perfect information and a finite tree, there is a determinate outcome — one can in principle compute the best play by working backward."
John Nash, on game structure
Section 11

Summary & Further Reading

Combinatorial game theory: finite positions, perfect information, no chance. Solve by backward induction. Use when moves are sequential and known — negotiations, auctions, multi-stage competition. Map the tree and reason from the end.
01
Book
Classic treatment of combinatorial games and solving strategies.
02
Online
Accessible intro to game theory including extensive form and backward induction.
03
Book
Strategic thinking and game trees in business and life.

Why this matters next

Frequently asked questions

What is Game Theory: Combinatorial?

Game Theory: Combinatorial is a mental model used for better thinking and decision-making.

How do you apply Game Theory: Combinatorial?

To apply Game Theory: Combinatorial, identify situations where this framework is relevant, then use it as a lens to evaluate your options and decisions. The model is most useful when combined with other complementary mental models.

What category does Game Theory: Combinatorial fall under?

Game Theory: Combinatorial falls under the Economics & Markets category of mental models. Other models in this category can be found on the Economics & Markets hub page.

Why is Game Theory: Combinatorial important?

Game Theory: Combinatorial is important because it provides a structured way to think about problems that would otherwise be approached with intuition alone. Understanding this model helps you avoid common reasoning errors and make better decisions.

Continue exploring

Get Faster Than Normal by email

Ideas from founders and companies.

Free newsletter. Unsubscribe anytime.

Or open the full subscribe page.

Popular Mental Models