Pure Strategies in Strategic-Form Games 🎯

Introduction: What is a pure strategy?

students, imagine two drivers approaching a traffic light at the same time. Neither driver can wait to see what the other does first. Each must choose a move based on the situation right now. In game theory, this kind of one-time, simultaneous decision is often studied using a strategic-form game, also called a normal-form game. A pure strategy is one complete plan that tells a player exactly what action to take in a given situation. In a simple one-shot game, it usually means choosing one action with certainty, not mixing between actions.

In this lesson, you will learn how to:

Define a pure strategy.
Read pure-strategy profiles from a game matrix.
Interpret the outcome of a pure-strategy profile.

These ideas are important because many real decisions happen all at once, with each person choosing a single action. Examples include two stores setting prices, two players choosing a move in rock-paper-scissors, or two companies deciding whether to advertise. Understanding pure strategies helps you predict outcomes in games where everyone acts at the same time. 🧠

Pure strategies and strategic-form games

A strategic-form game is a way to represent a game in a table or matrix. It lists each player’s possible actions and the payoff each player receives for every combination of choices. Because the players choose at the same time, no one gets to react after seeing the other player’s move.

A pure strategy is a single, definite choice. If a player has $2$ possible actions, then each action is a pure strategy in a one-shot game. If a player has $3$ possible actions, then each one is a pure strategy as well. The key feature is that the player does not randomize. They pick one action and stick to it.

For example, suppose a player can choose between $A$ and $B$. Then the set of pure strategies for that player is $\{A, B\}$. If the game is played once, choosing $A$ is one pure strategy, and choosing $B$ is another pure strategy.

This is different from a mixed strategy, where a player assigns probabilities to different actions. In this lesson, we focus only on pure strategies, which are simpler and easier to read from a game matrix. ✅

Reading pure-strategy profiles from a matrix

A pure-strategy profile is the full list of choices made by all players in the game. If there are two players, a pure-strategy profile looks like $\left(s_1, s_2\right)$, where $s_1$ is Player 1’s choice and $s_2$ is Player 2’s choice.

Here is a simple game matrix:

$\begin{array}{c|cc}$

& L & R \\

$\hline$

U & (3,2) & (0,4) \\

D & (5,1) & (1,3)

$\end{array}$

In this table, Player 1 chooses between $U$ and $D$, and Player 2 chooses between $L$ and $R$. Each cell gives the payoffs as an ordered pair. The first number is Player 1’s payoff, and the second number is Player 2’s payoff.

Let’s read each pure-strategy profile:

$\left(U, L\right)$ gives payoffs $(3,2)$.
$\left(U, R\right)$ gives payoffs $(0,4)$.
$\left(D, L\right)$ gives payoffs $(5,1)$.
$\left(D, R\right)$ gives payoffs $(1,3)$.

To read a profile correctly, look at the row for Player 1’s strategy and the column for Player 2’s strategy. Then read the payoff pair in that cell. This is the basic skill behind analyzing simultaneous-move games. 📊

A good habit is to say the profile out loud in order: “Player 1 chooses $D$, Player 2 chooses $R$.” That means the profile is $\left(D, R\right)$, and the outcome is the payoff pair $(1,3)$.

What the outcome of a pure-strategy profile means

The outcome of a pure-strategy profile is the specific result that happens when the chosen strategies are played. In strategic-form games, the outcome is usually shown as the payoff pair in the relevant cell of the matrix.

For example, in the game above, if the players choose $\left(U, R\right)$, the outcome is $(0,4)$. This means Player 1 gets $0$ and Player 2 gets $4$.

The payoff numbers show how good or bad the result is for each player. Bigger numbers are usually better, although the meaning depends on the game. In a sports game, a higher score is better. In a business game, a larger profit is better. In a punishment game, smaller costs might be better if the payoffs are measured as negative losses.

It is important to remember that an outcome is not the same as a strategy. The strategy is the choice made by a player. The outcome is what happens after both choices are combined. For instance:

Strategy choice: $\left(D, L\right)$
Outcome: $(5,1)$

The strategy profile describes the decisions. The payoff pair describes the result. That distinction matters in every game analysis. 🔍

Example 1: A simple coordination game

Consider this game:

$\begin{array}{c|cc}$

& A & B \\

$\hline$

A & (2,2) & (0,0) \\

B & (0,0) & (1,1)

$\end{array}$

Here, each player has two pure strategies: $A$ and $B$. So the possible pure-strategy profiles are:

$\left(A, A\right)$
$\left(A, B\right)$
$\left(B, A\right)$
$\left(B, B\right)$

Now interpret each outcome:

If both choose $A$, the outcome is $(2,2)$.
If one chooses $A$ and the other chooses $B$, the outcome is $(0,0)$.
If both choose $B$, the outcome is $(1,1)$.

This is called a coordination game because both players do better when their choices match. The pure-strategy profiles show all possible results, and the matrix lets you compare them quickly. In real life, this can resemble choosing a meeting place, a communication app, or a game mode with a friend. If both choose the same option, things work better. 🤝

Notice that the profile $\left(A, A\right)$ gives a higher payoff than $\left(B, B\right)$ for both players. That means it is better in this game, but the players still have to choose it at the same time. The matrix tells you the incentives; it does not force agreement.

Example 2: A competitive game with conflicting interests

Now look at a different game:

$\begin{array}{c|cc}$

& L & R \\

$\hline$

T & (4,1) & (0,3) \\

B & (2,2) & (1,0)

$\end{array}$

The pure-strategy profiles are:

$\left(T, L\right)$ with payoff $(4,1)$
$\left(T, R\right)$ with payoff $(0,3)$
$\left(B, L\right)$ with payoff $(2,2)$
$\left(B, R\right)$ with payoff $(1,0)$

Suppose the players choose $\left(B, L\right)$. The outcome is $(2,2)$. That means each player gets a payoff of $2$.

In games like this, one player may prefer one profile while the other prefers a different one. For example, Player 1 may like $\left(T, L\right)$ best because $4$ is the largest number in Player 1’s payoffs. Player 2 may like $\left(T, R\right)$ best because $3$ is the largest number in Player 2’s payoffs. This shows that a pure-strategy profile describes a possible result, but not necessarily a result both players want equally. 🎲

Understanding the payoff pair helps you interpret the game correctly. If you see $(0,3)$, you should read it as “Player 1 gets $0$ and Player 2 gets $3$,” not as two separate games. The pair belongs to one outcome of one profile.

Why pure strategies matter

Pure strategies are the foundation for analyzing more advanced ideas in game theory. Before you can study best responses, Nash equilibrium, or mixed strategies, you need to know how to read the basic game matrix.

Pure strategies matter because they answer questions like:

What action does each player choose?
What is the exact profile of choices?
What payoff results from that profile?

In real-world situations, pure strategies are common when a decision must be made without hesitation or without randomness. A store may choose a single price. A player may choose one move in a board game. A voter may select one candidate. Even when people later change their minds, the single-choice version is often the first step in modeling behavior.

When you look at a matrix, remember this simple process:

Identify each player’s available pure strategies.
Pick one strategy for each player.
Combine them into a profile like $\left(s_1, s_2\right)$.
Read the payoff pair in the matching cell.

This process is the core of strategic-form analysis. Once you can do it quickly, you can move on to deeper questions about which profiles are stable or likely. 🚀

Conclusion

students, a pure strategy is one definite action chosen by a player in a game. In a strategic-form game, pure strategies are shown in a matrix, and a pure-strategy profile is the complete set of choices made by all players. The outcome of that profile is the payoff pair in the matching cell.

You should now be able to define a pure strategy, read a pure-strategy profile from a game matrix, and interpret the outcome that results. These skills are the starting point for studying how people make decisions when they act at the same time.

Study Notes

A pure strategy is one specific action chosen with certainty.
A strategic-form game shows players’ actions and payoffs in a matrix.
A pure-strategy profile lists one pure strategy for each player, such as $\left(U, R\right)$.
The outcome of a profile is the payoff pair in the corresponding cell.
In a payoff pair $(x,y)$, the first number is Player 1’s payoff and the second number is Player 2’s payoff.
To read a matrix, match Player 1’s row choice with Player 2’s column choice.
Pure strategies are useful for modeling one-time, simultaneous decisions in real life.
Knowing how to read pure-strategy profiles is essential for later topics in game theory.