Game Theory Payoff Matrix Calculator

Use this Game Theory Payoff Matrix Calculator to enter values, adjust options, and review results in a compact responsive workspace.

Results are calculated automatically as you enter data.

Preset

Row player Column player

Strategies	Column 1	Column 2
Row 1	A B	A B
Row 2	A B	A B

Show best responses in the matrix

Equilibrium summary Update the matrix to analyze the game.

Fixed-strategy sampling against the model

Your row strategy Rounds Seed

Mixed strategy formula

Sampling results

Run a simulation to see results.

Disclaimer: All tools on this site are intended for educational and informational purposes only. Not professional advice or a decision tool. No guarantee of accuracy; verify data, assumptions, rules, model fit, and results before important use. See our Terms of Use.

Assumptions and limitations

Results are estimates for educational and exploratory use only and are not professional advice. No guarantee is made that outputs are accurate, complete, current, suitable, or error-free. Verify inputs, units, formulas, assumptions, rounding, data quality, model fit, and applicable rules independently. Do not rely on this calculator as the only basis for financial, legal, medical, safety, academic, business, official, eligibility, or regulated decisions; consult a qualified professional when stakes are material. Use of this calculator is subject to our Terms of Use.

▼ See explanations and tips below ▼

Related Calculators

What Is a 2x2 Normal-Form Game?

A 2x2 normal-form game is a simple model of strategic choice. It has two players, and each player has two available strategies. The outcome depends on the strategy chosen by both players, not just one player acting alone.

The game is usually shown as a payoff matrix. The row player chooses one row, the column player chooses one column, and the cell where they meet gives the payoff pair for that outcome. The first number is the row player’s payoff, and the second number is the column player’s payoff.

For a general 2x2 game, the payoff matrix can be written as:

$$ \begin{array}{c|cc} & C_1 & C_2 \\ \hline R_1 & (a_{11}, b_{11}) & (a_{12}, b_{12}) \\ R_2 & (a_{21}, b_{21}) & (a_{22}, b_{22}) \end{array} $$

Here, $R_1$ and $R_2$ are the row player’s strategies, $C_1$ and $C_2$ are the column player’s strategies, $a$ values are row-player payoffs, and $b$ values are column-player payoffs.

Payoffs are not required to be money. They can represent utility, points, losses, satisfaction, penalties, or any other numeric score where a higher value is better for that player. Negative payoffs are allowed; for example, $-1$ is better than $-5$ because it is the higher number.

Why 2x2 Game Analysis Matters

Many strategic situations involve a small number of meaningful choices: compete or cooperate, enter or stay out, confess or stay silent, swerve or continue, match or mismatch. A 2x2 game does not capture every real-world detail, but it gives a clear way to compare incentives.

The main value of a payoff matrix is that it separates different questions that are often confused:

What is each player’s best response to the other player’s action?
Is there an outcome where neither player wants to change strategy alone?
Does one strategy dominate another?
Is the equilibrium efficient, or could both players be better off elsewhere?
If no pure outcome is stable, can randomizing between strategies make sense?

These questions are especially useful in introductory economics, political science, decision theory, operations research, and classroom examples of strategic reasoning.

Key Terms to Know

Strategy: One action or plan available to a player, such as choosing $R_1$ instead of $R_2$.

Payoff: The numeric result a player receives from an outcome. Higher payoffs are treated as better for that player.

Payoff matrix: A table showing all strategy combinations and the payoff pair attached to each outcome.

Best response: A strategy that gives a player the highest payoff, given the other player’s chosen strategy.

Pure strategy: A strategy chosen with certainty.

Pure Nash equilibrium: A cell where both players are choosing best responses to each other. At that cell, neither player can improve their own payoff by changing strategy alone.

Dominant strategy: A strategy that performs at least as well as another strategy no matter what the other player does. If it is strictly better in every comparison, it is strictly dominant. If it is at least as good in every comparison and better in at least one, it is weakly dominant.

Pareto-efficient outcome: An outcome that is not Pareto-dominated by another outcome. In a payoff matrix, this means there is no other cell that makes at least one player better off without making the other player worse off.

Mixed strategy: A probability rule for randomizing between pure strategies.

Expected payoff: The weighted average payoff from a strategy or mixture, using probabilities as the weights.

How 2x2 Game Analysis Works

The analysis starts by comparing payoffs from each player’s point of view. Because each player wants a higher payoff for themselves, the row player compares row payoffs within each column, while the column player compares column payoffs within each row.

Best responses

To find the row player’s best response, hold the column player’s strategy fixed and compare the row player’s two payoffs.

If the column player chooses $C_1$, the row player compares $a_{11}$ with $a_{21}$. If $a_{11} > a_{21}$, then $R_1$ is the row player’s best response to $C_1$. If $a_{21} > a_{11}$, then $R_2$ is the best response. If the two payoffs are equal, both row strategies are best responses.

To find the column player’s best response, hold the row player’s strategy fixed and compare the column player’s two payoffs.

If the row player chooses $R_1$, the column player compares $b_{11}$ with $b_{12}$. If $b_{11} > b_{12}$, then $C_1$ is the column player’s best response to $R_1$. If $b_{12} > b_{11}$, then $C_2$ is the best response. If they are equal, both column strategies are best responses.

Pure Nash equilibria

A pure Nash equilibrium occurs when the row player’s best response and the column player’s best response point to the same cell.

A 2x2 game can have no pure Nash equilibrium, one pure Nash equilibrium, or multiple pure Nash equilibria. The number of pure equilibria is not a measure of how good the game is. It only counts how many cells are stable against one-player-at-a-time deviations.

Dominance

Dominance compares one strategy against another across all possible choices of the other player.

For the row player, $R_1$ weakly dominates $R_2$ if:

$$ a_{11} \ge a_{21} $$

and

$$ a_{12} \ge a_{22} $$

with at least one strict inequality. It strictly dominates $R_2$ if both inequalities are strict.

The same idea applies to the column player by comparing $C_1$ and $C_2$ across the row player’s possible strategies.

A dominant strategy is stronger than a best response. A best response is best against one specific opponent strategy. A dominant strategy is best, or tied for best, across all opponent strategies being compared.

Pareto efficiency

Pareto efficiency looks at outcomes rather than incentives to deviate. A cell is Pareto-efficient if no other cell gives both players at least as much and gives at least one player more.

This is different from Nash equilibrium. A Nash equilibrium can be Pareto-inefficient, and a Pareto-efficient outcome may fail to be a Nash equilibrium. The Prisoner’s Dilemma is the classic example: the equilibrium is stable because neither player wants to change alone, even though both players could be better off at a different outcome.

Mixed strategies

Some 2x2 games do not have a pure Nash equilibrium. Matching Pennies is a common example: each player’s best response pushes the other player away from the current cell, so no pure outcome is stable.

A mixed strategy assigns probabilities to the two pure strategies. Let $p$ be the probability that the row player chooses $R_1$, and let $q$ be the probability that the column player chooses $C_1$.

The row player is indifferent between $R_1$ and $R_2$ when the expected payoff from the two row strategies is equal:

$$ q a_{11} + (1-q)a_{12} = q a_{21} + (1-q)a_{22} $$

Solving for $q$ gives:

$$ q = \frac{a_{22} - a_{12}}{a_{11} - a_{12} - a_{21} + a_{22}} $$

The column player is indifferent between $C_1$ and $C_2$ when:

$$ p b_{11} + (1-p)b_{21} = p b_{12} + (1-p)b_{22} $$

Solving for $p$ gives:

$$ p = \frac{b_{22} - b_{21}}{b_{11} - b_{21} - b_{12} + b_{22}} $$

These formulas are meaningful as mixed-strategy probabilities only when the denominators are not zero and the resulting probabilities fall between $0$ and $1$. A probability of $0$ or $1$ is a boundary case, not a fully interior randomization.

Examples of 2x2 Game Analysis in Practice

Example 1: Prisoner’s Dilemma-style payoffs

Suppose both players can either confess or stay silent, with payoffs shown below:

$$ \begin{array}{c|cc} & \text{Column confess} & \text{Column stay silent} \\ \hline \text{Row confess} & (-5, -5) & (0, -10) \\ \text{Row stay silent} & (-10, 0) & (-1, -1) \end{array} $$

For the row player, confessing is better if the column player confesses because $-5 > -10$. Confessing is also better if the column player stays silent because $0 > -1$. So confessing strictly dominates staying silent for the row player.

The same comparison holds for the column player. The result is a pure Nash equilibrium at confess-confess.

That does not mean confess-confess is the best joint outcome. If both players stayed silent, each would get $-1$, which is better for both than $-5$. This shows why Nash equilibrium and Pareto efficiency answer different questions.

Example 2: Matching Pennies and a mixed strategy

In a simple Matching Pennies game, the row player wins when the choices match, while the column player wins when they do not match:

$$ \begin{array}{c|cc} & C_1 & C_2 \\ \hline R_1 & (1, -1) & (-1, 1) \\ R_2 & (-1, 1) & (1, -1) \end{array} $$

There is no pure Nash equilibrium because at every cell, one player wants to switch. The mixed strategy solves this by making the other player indifferent.

For the column player’s probability $q$ of choosing $C_1$:

$$ q = \frac{a_{22} - a_{12}}{a_{11} - a_{12} - a_{21} + a_{22}} = \frac{1 - (-1)}{1 - (-1) - (-1) + 1} = \frac{2}{4} = 0.5 $$

By symmetry, the row player’s probability is also:

$$ p = 0.5 $$

So each player randomizes equally between the two strategies. In this case, the expected payoff is $0$ for both players.

Example 3: Ties and edge cases

Ties matter because a player can have more than one best response. For example, if the row player receives the same payoff from $R_1$ and $R_2$ when the column player chooses $C_1$, then both row strategies are best responses to $C_1$.

Ties can create multiple equilibria or make a game degenerate. In mixed-strategy calculations, a flat indifference equation can make the denominator zero. When that happens, the usual 2x2 formula cannot identify a single interior mixed-strategy pair. The right interpretation is that the game needs a more careful equilibrium analysis than a single $p, q$ formula can provide.

How to Interpret the Result

The result is best read as a map of incentives, not as a prediction that must happen in real life.

A Pure Nash count of $0$ means no single payoff cell is stable against unilateral deviation. A count of $1$ means there is one pure-strategy cell where both players are best-responding. A count greater than $1$ means several cells satisfy the pure Nash condition, often because of coordination incentives or payoff ties. This count is not an equilibrium payoff; it is only the number of cells that meet the pure Nash test.

The mixed-strategy probabilities show how often each player would choose their first listed strategy in the computed mixed-strategy calculation. The row player’s probability is $P(R_1)$, and the column player’s probability is $P(C_1)$. A value near $0\%$ means the first strategy is rarely used in that mix; a value near $100\%$ means it is almost always used. In formula displays, these may appear as raw probabilities such as $0.25$; in summary displays, the same value may appear as $25\%$.

The expected payoff is the average payoff implied by the calculated probabilities. It is not a guaranteed payoff in any one round. It is a long-run average under the model’s probability assumptions.

The dominance result tells you whether one strategy is always at least as good as the other strategy for a player, given the two choices in the matrix. Dominance is useful because it does not depend on predicting exactly what the other player will do.

The Pareto-efficient cells count tells you how many outcomes are not dominated by another outcome from the standpoint of both players’ payoffs. More Pareto-efficient cells does not automatically mean a better game; it may simply mean there are several trade-off outcomes where one player gains only if the other gives something up.

The simulation result should be treated as a random sample illustration. With a small number of rounds, the simulated average can differ noticeably from the analytical expected payoff.

Common Mistakes and Misconceptions

Leaving a payoff cell blank or entering text. Each payoff entry needs a finite number. If a payoff is unknown, it is better to estimate it deliberately than to leave the cell empty.

Assuming every game has one pure Nash equilibrium. A 2x2 game may have no pure equilibrium, one pure equilibrium, or multiple pure equilibria.

Treating Pareto efficiency as the same thing as Nash equilibrium. Nash equilibrium is about incentives to change strategy alone. Pareto efficiency is about whether another outcome could improve at least one player’s payoff without reducing the other player’s payoff.

Reading negative payoffs as invalid. Negative payoffs can be perfectly valid. They usually represent costs, losses, penalties, or bad outcomes. The important rule is that higher numbers are better for the player receiving them.

Swapping the two payoffs in a cell. In a payoff pair such as $(3, -1)$, the first number belongs to the row player and the second belongs to the column player.

Confusing raw probabilities with percentages. A raw probability of $0.4$ is the same as $40\%$. Check whether the result is showing a decimal probability or a percentage.

Assuming the simulation models learning. A short simulation can illustrate random outcomes, but it does not prove that players learn, adapt, punish, cooperate, or coordinate over time.

When to Use 2x2 Game Analysis

Use 2x2 game analysis when a situation can reasonably be simplified to:

Two decision makers.
Two strategies for each decision maker.
Numeric payoffs for all four strategy combinations.
Choices made without one player simply observing and responding after the other player’s choice.

It is especially useful for studying classic games such as Prisoner’s Dilemma, Stag Hunt, Chicken, and Matching Pennies. It can also help compare simplified business, negotiation, policy, classroom, and competitive scenarios.

Limitations and Things to Keep in Mind

A 2x2 payoff matrix is a simplified model. It does not include more than two players, more than two strategies per player, sequential moves, incomplete information, bargaining, communication, repeated-game punishments, learning, reputation, or changing payoffs over time.

The results depend entirely on the payoff numbers entered. If the payoffs are speculative, incomplete, or scaled poorly, the analysis will reflect those assumptions.

The mixed-strategy formulas report a single $p, q$ pair when the standard indifference equations produce valid probabilities. Degenerate games, flat equations, boundary cases, and games with more complex equilibrium sets may require additional analysis.

Ties count as best responses. This is mathematically appropriate, but it can make results look less decisive than a strict comparison.

Rounding can affect how results look. Values with absolute size below about $10^{-10}$ may display as $0$. Most payoff-based numeric outputs use up to $4$ decimal places, percentages use up to $2$ decimal places, and formula-card probabilities for $p$ and $q$ may use up to $5$ decimal places.

Simulation rounds are meant for short illustrations. Enter a whole number from $1$ through $50$; fractional, blank, and out-of-range values are rejected, so the simulation is not designed for long-run statistical testing.

Fixed-strategy sampling is reproducible when the same seed, payoff matrix, selected row strategy, and round count are used. It should not be treated as evidence that players would learn, adapt, punish, cooperate, or coordinate in a real repeated game.

Payoff values are unitless. The analysis does not convert payoffs into currency, probabilities, welfare units, or real-world utility scales.

How to Use This Calculator

Choose a preset game or use a custom payoff matrix.
Enter the row player and column player names, if you want custom labels.
Enter the two row strategy names and two column strategy names.
Fill in all four payoff pairs. In each cell, use the first payoff for the row player and the second payoff for the column player.
Turn on best-response highlighting if you want to see which payoffs are best responses.
Review the result summary, pure Nash count, dominance notes, Pareto-efficient outcomes, mixed-strategy probabilities, and expected payoffs.
For a simulation, choose the row player’s strategy, enter the number of rounds, and run the simulation. The row player uses the selected strategy during the simulation, while the column choices are generated from the calculator’s response rule.
Download the visual as a PNG if you need to save the payoff matrix or strategy map.

Frequently Asked Questions

What does the payoff pair in each cell mean?

The payoff pair shows the result for both players at that outcome. The first number is the row player’s payoff, and the second number is the column player’s payoff. Each player compares only their own payoffs when choosing a best response.

What does $p$ mean in a mixed-strategy result?

$p$ is the probability that the row player chooses the first row strategy. For example, $p = 0.3$ means the row player chooses the first row strategy $30\%$ of the time in the computed mix.

What does $q$ mean in a mixed-strategy result?

$q$ is the probability that the column player chooses the first column strategy. It is calculated by making the row player indifferent between the two row strategies.

Can a Pareto-efficient outcome be different from a Nash equilibrium?

Yes. Pareto efficiency and Nash equilibrium measure different things. A Nash equilibrium can be inefficient, and a Pareto-efficient outcome may not be stable if one player can improve by changing strategy alone.

Why might there be no valid mixed-strategy result?

The formula may fail when a denominator is zero, when the indifference equation is flat, or when the calculated probability falls outside the range from $0$ to $1$. In those cases, the game may still have important strategic structure, but it is not summarized by one standard interior mixed-strategy pair.

Are negative payoffs allowed?

Yes. Negative payoffs are valid as long as they are finite numbers. They often represent losses, costs, penalties, or undesirable outcomes, and the higher number is still treated as better.

Sources and References

Books

Martin J. Osborne and Ariel Rubinstein. A Course in Game Theory. MIT Press, 1994. Relevant parts used: strategic games, Nash equilibrium, and mixed strategies. MIT Press publisher page.
Robert S. Gibbons. Game Theory for Applied Economists. Princeton University Press, 1992. Relevant part used: Chapter 1 on normal-form games and Nash equilibrium. Google Books listing.

Online and Educational Sources

MIT OpenCourseWare. “Chapter 6: Nash Equilibrium.” 14.12 Economic Applications of Game Theory, Fall 2012. Used for best responses, Nash equilibrium, dominance comparisons, and mixed-strategy equilibrium definitions. PDF.
CORE Econ. “4.5 Evaluating outcomes: The Pareto criterion.” The Economy 2.0: Microeconomics. Accessed June 28, 2026. Used for Pareto dominance, Pareto efficiency, and limitations of the Pareto criterion. Resource.
Yale University, Open Yale Courses. “ECON 159: Lecture 10 — Mixed Strategies in Baseball, Dating and Paying Your Taxes.” Accessed June 28, 2026. Used for interpretations of mixed strategies as randomization, beliefs, and population proportions. Resource.