Two Player Game Payoff Matrix Quiz

Simultaneous-move games require each player to act without knowing the rival's choice, creating true strategic interdependence. A player must reason about what the rival will likely do and choose accordingly. This uncertainty is what makes payoff matrices essential: they map all possible strategy combinations so that each player can reason through every scenario systematically and identify the optimal response before committing to a choice.

By convention, each cell in a two-player payoff matrix contains two numbers. The first number is the payoff for the row player, and the second is the payoff for the column player, for that specific pair of strategies. Reading each cell correctly is the essential first step in identifying dominant strategies, comparing outcomes across the matrix, and locating Nash equilibria where both players are simultaneously making best responses.

With two strategies available to each player, the matrix has 2 rows and 2 columns, producing 2 multiplied by 2 equals 4 cells. Each cell represents one unique combination of strategies. Every possible strategic interaction in the game is captured within these four cells, making the 2-by-2 payoff matrix the most frequently used format for analyzing dominant strategies, Nash equilibria, and classic game structures like the Prisoners Dilemma.

Defecting yields 9 against a cooperating rival and 2 against a defecting rival. Cooperating yields 6 and 0 respectively. Defection strictly dominates cooperation for both players. The Nash equilibrium is mutual defection at (2,2) even though both would earn more at (6,6). This is the Prisoners Dilemma: individually rational choices produce a collectively suboptimal outcome, a result that cannot be avoided without binding commitment mechanisms.

Nash equilibria can exist without dominant strategies. When no single strategy is optimal under all rival choices, players look for a cell where each is simultaneously playing a best response to the other. This mutual best response condition defines Nash equilibrium regardless of whether dominant strategies exist. In coordination games and other settings, equilibria are found by checking best responses across the matrix rather than through dominance reasoning alone.

Since Row 1 yields 7 and Row 2 yields 4 under every possible rival strategy, Row 1 strictly dominates Row 2. A rational Player 1 will always choose Row 1. This is the clearest application of dominance in a payoff matrix: when one strategy is always better, the decision is unambiguous and does not depend on what the rival chooses. Eliminating dominated strategies simplifies analysis and often leads directly to the Nash equilibrium.

Payoff matrices display both players' outcomes in each cell, and dominant strategies are found by comparing payoffs within rows or columns. Games can have multiple Nash equilibria. The claim that Nash equilibria always maximize combined payoffs is false: the Prisoners Dilemma produces a Nash equilibrium at (2,2) when both players could earn more at (6,6), clearly showing that equilibrium and collective optimality do not always coincide.

This coordination game has two Nash equilibria. Both players prefer to match but without communication may independently select different equilibria, resulting in a mismatch and zero payoffs for both. The payoff matrix reveals the structure clearly but cannot resolve which equilibrium players will reach. A shared focal point, convention, or direct communication is needed to ensure both players select the same equilibrium and avoid the zero-payoff outcome.

Zero-sum games have a fixed total payoff in every cell. Whatever one player gains comes directly at the other's expense. This perfectly opposed interest structure means maximizing one player's payoff is identical to minimizing the rival's payoff. Zero-sum games represent purely competitive interactions with no scope for mutual gain, in contrast to non-zero-sum games where cooperative strategies can improve outcomes for both players simultaneously.

When no cell in the payoff matrix constitutes a mutual best response in pure strategies, Nash's theorem guarantees a mixed strategy Nash equilibrium exists. In a mixed strategy equilibrium, players randomize between their strategies with probabilities calculated to make the rival indifferent between their own options. This provides a stable and predictable solution to games that would otherwise appear to have no equilibrium in pure strategies.

For each player: High against a rival playing High yields 3 versus 1 for Low. High against a rival playing Low yields 6 versus 5 for Low. High dominates Low in both cases. Both players will choose High at the Nash equilibrium earning (3,3), even though mutual Low would give each player 5. This illustrates how dominant strategy reasoning produces a Nash equilibrium that is collectively inferior to a cooperative outcome neither player has individual incentive to pursue.

When each player has a dominant strategy, the Nash equilibrium is located at the cell where both players simultaneously play their dominant strategies. At this intersection, neither player can improve by switching since their dominant strategy is already the best response to any rival action. This produces the most clearly predictable Nash equilibrium in game theory and is the most direct application of payoff matrix analysis in strategic decision-making.

Rational players always choose their dominant strategy. Since Column 2 is always better for Player 2, Player 1 can confidently anticipate that Player 2 will play Column 2 and should choose their own best response to that specific column. This reasoning process, anticipating a rival's dominant strategy and responding optimally, is a fundamental pattern in payoff matrix analysis and directly leads to the Nash equilibrium prediction.

Two-player payoff matrices are versatile tools that expose strategic incentives across many economic contexts. They identify Prisoners Dilemma structures, show when rational self-interest creates collectively worse outcomes, and apply broadly to pricing, advertising, and entry decisions in oligopolistic markets. The claim that players always reach cooperative outcomes is false: in Prisoners Dilemma games, rational players end up at equilibria worse than mutual cooperation because individual incentives push both toward defection.

Advertising yields 4 against a rival that advertises and 8 against a rival that does not. Not advertising yields 2 and 6 respectively. Since advertising always beats not advertising, it is the dominant strategy for each firm. Both firms advertise at the Nash equilibrium earning (4,4), even though mutual restraint would yield (6,6). This advertising Prisoners Dilemma illustrates how dominant strategy reasoning drives both players to an outcome worse than what cooperation would have achieved.