Analyzes decision-making among multiple players whose
choices interdependently shape outcomes, focusing on strategic
interactions and equilibria.
How would you explain it like I'm…
Game Plan for Every Move
Imagine playing rock-paper-scissors with a friend. A game-theory strategy is not just what you throw this time. It is a giant rule book that says what you would throw if your friend smiled, if she frowned, if she had won the last round, if she had lost, in every possible case. A strategy is the whole what-if book, not just one pick.
What-To-Do-If Plan
In games like chess or tag, your moves depend on what the other player does, and their moves depend on what they think you will do. A game-theory strategy is a complete plan that says what you would do in every situation you could possibly face, even ones that never come up. It is a rule for every branch of the game, not just the path that actually happened. That way, your choices stay smart no matter which way the game turns.
Strategy as a Full Playbook
In game theory, a strategy is not a single move but a complete rule that tells a player what to do at every point where they might have to decide. It is more like a computer program than a guess. The idea is that in any interactive situation, your best move depends on what others do, which depends on what they expect you to do. So you must commit to behavior in every possible situation, including ones that will never actually happen, because those off-path commitments still shape what others believe and therefore what they choose. A strategy thus maps each possible history of the game to an action.
A game-theoretic strategy is a complete contingent specification, for one player in a fully described game, of which action the player will take at every information set (every distinguishable situation in which they might have to move) that could arise during play. Formally, it is a policy function from observed history to action, not a single moment of choice. The motivation is that rational behavior under strategic interdependence must be closed under counterfactual reasoning: payoffs depend on others' moves, which depend on others' expectations of you, so analysis must specify behavior even at information sets that will never be reached in equilibrium. A strategy may be pure (one action per information set), mixed (a probability distribution over pure strategies), behavioral (independent randomization at each information set), or correlated (via a public signal). It is paired with a solution concept (such as Nash equilibrium or subgame-perfect equilibrium) that defines what makes it optimal given other players' strategies. The construct was systematized by von Neumann and Morgenstern (1944).
Parents (1) — more general patterns this builds on
Game-Theoretic Strategyis a decomposition ofFunction (Mapping) — A game-theoretic strategy is the specific shape function takes when the mapping is from observed game history to a chosen action at each information set.
Game-Theoretic Strategy is not Mechanism Design because Game Theory Strategy models how agents interact when anticipating each other's choices, whereas Mechanism Design creates rules or systems that incentivize desired outcomes.
Game-Theoretic Strategy is not Markov Decision Processes (MDPs) because Game Theory Strategy is the formal mathematical modeling of situations where agents have interdependent payoffs, whereas Markov Decision Processes are sequential decision-making frameworks where outcomes depend on current state and action.
Game-Theoretic Strategy is not Variation Strategies because Game Theory Strategy frames conflicts as mathematical games with interdependent payoffs, whereas Variation Strategies are approaches to generating or exploring different alternatives.