Mathwords logoMathwords

Payoff — Definition, Formula & Examples

A payoff is the number that measures what a player gets from a game, such as points, profit, or years in prison, once every player has made a choice. A payoff matrix is a table that lists the payoffs for every possible combination of choices. In everyday use, a payoff can also mean a reward or paying off a debt in full; this page covers the game theory sense.

In a game with players 1,2,…,n1, 2, \dots, n and strategy sets S1,S2,…,SnS_1, S_2, \dots, S_n, the payoff function of player ii is a function ui:S1×S2×⋯×Sn→Ru_i : S_1 \times S_2 \times \cdots \times S_n \to \mathbb{R}. It assigns a real number to each strategy profile, and a larger number means an outcome that player ii prefers. For a finite two-player game in which the row player has strategies s1,…,sms_1, \dots, s_m and the column player has strategies t1,…,tkt_1, \dots, t_k, the payoff matrix is the m×km \times k array whose (j,l)(j, l) entry is the ordered pair (u1(sj,tl), u2(sj,tl))\big(u_1(s_j, t_l),\, u_2(s_j, t_l)\big).

Key Formula

E=q a+(1−q) bE = q\,a + (1-q)\,b
Where:
  • EE = expected payoff of one of your strategies
  • qq = probability that the opponent plays their first strategy
  • aa = your payoff if the opponent plays their first strategy
  • bb = your payoff if the opponent plays their second strategy

How It Works

Each row of a payoff matrix is one choice for the row player, and each column is one choice for the column player. A cell lists the row player's payoff first and the column player's payoff second. To find your best response, fix the opponent's choice (a column) and pick the row with your highest payoff. If the opponent chooses randomly, you weight each payoff by its probability and add, which gives an expected payoff.

Worked Example

Problem: Two stores, A and B, each set either a High or a Low price. Profits are in millions of dollars and are written as (A's payoff, B's payoff): (High, High) gives (5, 5), (High, Low) gives (1, 7), (Low, High) gives (7, 1), and (Low, Low) gives (3, 3). What is A's best choice, and what happens if both stores reason the same way?
Step 1: Arrange the payoffs in a matrix. A chooses the row, B chooses the column, and A's payoff is listed first in each cell.
B: HighB: LowA: High(5, 5)(1, 7)A: Low(7, 1)(3, 3)\begin{array}{c|cc} & \text{B: High} & \text{B: Low} \\ \hline \text{A: High} & (5,\,5) & (1,\,7) \\ \text{A: Low} & (7,\,1) & (3,\,3) \end{array}
Step 2: Suppose B picks High. Compare A's payoffs in that column: High gives A 5 and Low gives A 7. Low is better for A.
7>57 > 5
Step 3: Suppose B picks Low. Compare A's payoffs in that column: High gives A 1 and Low gives A 3. Low is better again.
3>13 > 1
Step 4: Low is better for A no matter what B does, so Low is a dominant strategy. The game is symmetric, so B reasons the same way. Compare the combined profit of (Low, Low) with that of (High, High).
3+3=6vs.5+5=103 + 3 = 6 \quad\text{vs.}\quad 5 + 5 = 10
Answer: A's best choice is Low. If both stores choose Low, each earns $3 million, for a total of $6 million. Both stores would be better off at (High, High) with $5 million each. This is a Prisoner's Dilemma.

Another Example

Problem: Using the same payoff matrix, store B now picks High or Low by flipping a fair coin, so q=0.5q = 0.5. Find A's expected payoff for each of A's choices.
Step 1: If A picks High, A gets 5 when B plays High and 1 when B plays Low.
EHigh=0.5(5)+0.5(1)=3E_{\text{High}} = 0.5(5) + 0.5(1) = 3
Step 2: If A picks Low, A gets 7 when B plays High and 3 when B plays Low.
ELow=0.5(7)+0.5(3)=5E_{\text{Low}} = 0.5(7) + 0.5(3) = 5
Answer: A's expected payoff is $3 million from High and $5 million from Low, so Low is still the better choice.

Why It Matters

Payoff matrices are the starting point for every problem in an introductory game theory or microeconomics course. Economists use them to model price wars between competing firms, and the same tables appear in AP Microeconomics questions on oligopoly. Biologists use payoffs to measure reproductive success in evolutionary game theory.

Common Mistakes

Mistake: Reading the wrong number in a cell, such as using the column player's payoff when deciding what the row player should do.
Correction: The row player's payoff is listed first and the column player's payoff second. When you analyze one player, look only at that player's numbers.
Mistake: Assuming players choose the cell with the largest total payoff.
Correction: In standard game theory, each player maximizes their own payoff, not the group's total. That is why both stores in the example end up at (Low, Low) even though (High, High) gives each store more.

Related Terms

  • Game Theory — The field that studies payoffs and strategic choices
  • Prisoner's Dilemma — Classic game defined by its payoff matrix
  • Pareto Optimality — Compares outcomes using every player's payoffs
  • Fair Game — A game whose expected payoff is zero
  • Optimization — Players choose strategies to maximize their payoffs
  • Matrix — Payoff matrix is a table arranged as a matrix