What is Normal Form Representation in Game Theory

This article provides a comprehensive overview of the normal form representation in game theory, detailing how it mathematically defines strategic interactions. You will learn about the three essential components that comprise a normal form game—players, strategies, and payoffs—and how these elements are visually structured using a payoff matrix to analyze simultaneous decision-making.

Defining the Normal Form Representation

In game theory, the normal form (also known as the strategic form) is a description of a game. Unlike the extensive form, which uses a decision tree to represent games that unfold sequentially, the normal form is primarily used for static games where players make their moves simultaneously, or at least without knowledge of the other players’ actions.

A game in normal form is mathematically defined by three core elements:

1. Players: The set of decision-makers participating in the game. A game must have at least two players to be considered strategic.
2. Strategies: The complete set of actions or choices available to each player. For a game to be represented in normal form, every player’s strategy space must be clearly defined.
3. Payoffs: The reward, utility, or cost that each player receives as a result of the combination of strategies chosen by all players. Payoffs are represented as numbers mapping the outcome of the joint decisions.

The Payoff Matrix

For two-player games with a finite number of strategies, the normal form is most commonly represented visually as a grid called a payoff matrix.

In a standard two-player payoff matrix: * One player is designated as the “Row Player” and their available strategies label the rows. * The second player is designated as the “Column Player” and their available strategies label the columns. * Each cell inside the grid represents a specific outcome resulting from the intersection of the players’ chosen strategies. * Within each cell, the payoffs for both players are listed as an ordered pair (usually written as Row Player Payoff, Column Player Payoff).

Mathematical Formulation

More formally, a normal form game is represented as a tuple:

\[G = (N, (S_i)_{i \in N}, (u_i)_{i \in N})\]

Where: * \(N\) is the set of players, indexed by \(i\). * \(S_i\) is the strategy set for player \(i\). A specific strategy profile \(s\) is a combination of strategies chosen by all players. * \(u_i\) is the payoff function for player \(i\), which maps the strategy profile to a real-world number (\(u_i: S \rightarrow \mathbb{R}\)).

Why the Normal Form is Used

The primary benefit of the normal form representation is its simplicity and elegance in identifying optimal strategies. By laying out all possible outcomes in a structured grid, analysts can easily identify dominant strategies, dominated strategies, and find the Nash Equilibrium—the state where no player has an incentive to unilaterally deviate from their chosen strategy. While it abstracts away the timing of moves, it remains the foundational tool for analyzing classic scenarios like the Prisoner’s Dilemma, the Battle of the Sexes, and Hawk-Dove games.