Sign in to save

Bookmark this page so you can find it later.

Sign in to save

Bookmark this page so you can find it later.

Game theory studies how people, teams, companies, or countries make decisions when each outcome depends on the choices of multiple decision makers. This cheat sheet covers the basic language and tools used to analyze simple strategic games. Students need it to organize payoff matrices, compare strategies, and predict likely outcomes.

It is especially useful for algebra, economics, probability, and decision-making applications.

The main ideas are players, strategies, payoffs, best responses, dominant strategies, and Nash equilibrium. In a payoff matrix, each cell lists the results for both players, often as (Player 1 payoff,Player 2 payoff)(\text{Player 1 payoff}, \text{Player 2 payoff}). A Nash equilibrium occurs when no player can improve by changing only their own strategy.

In mixed strategies, players use probabilities, and expected payoff is found with E=pixiE = \sum p_i x_i.

Key Facts

  • A strategic game has players, available strategies, and payoffs that depend on the combination of choices made by all players.
  • A payoff matrix entry such as (3,2)(3, 2) means Player 1 receives payoff 33 and Player 2 receives payoff 22.
  • A best response is the strategy that gives a player the highest payoff for a fixed strategy chosen by the other player.
  • A dominant strategy gives a player a higher payoff than every other available strategy no matter what the other player does.
  • A Nash equilibrium is a strategy combination where each player's strategy is a best response to the other's strategy.
  • In a zero-sum game, one player's gain equals the other player's loss, so the total payoff is 00 for every outcome.
  • The expected payoff of a random strategy is E=pixiE = \sum p_i x_i, where pip_i is the probability of outcome ii and xix_i is its payoff.
  • For a mixed strategy with two options, if option A is chosen with probability pp, then option B is chosen with probability 1p1 - p.

Vocabulary

Player
A player is a decision maker in a game, such as a person, firm, team, or country.
Strategy
A strategy is a complete plan for what a player will do in the game.
Payoff
A payoff is the numerical value of an outcome for a player, such as points, profit, cost, or utility.
Best Response
A best response is the strategy that gives the greatest payoff against a specific strategy chosen by another player.
Nash Equilibrium
A Nash equilibrium is an outcome where no player can improve their payoff by changing only their own strategy.
Mixed Strategy
A mixed strategy is a strategy where a player chooses among options using probabilities.

Common Mistakes to Avoid

  • Reversing the payoff order in a matrix is wrong because (a,b)(a, b) usually means Player 1 gets aa and Player 2 gets bb.
  • Calling any high-payoff outcome a Nash equilibrium is wrong because each player's choice must be a best response to the other player's choice.
  • Confusing a dominant strategy with a best response is wrong because a dominant strategy must work best against every possible opponent choice.
  • Forgetting that probabilities must add to 11 is wrong because a mixed strategy with two probabilities must satisfy p+(1p)=1p + (1 - p) = 1.
  • Assuming both players always want the same outcome is wrong because some games are competitive, and in a zero-sum game the payoffs add to 00.

Practice Questions

  1. 1 In a payoff matrix, one outcome is listed as (4,1)(4, -1). What payoff does Player 1 receive, and what payoff does Player 2 receive?
  2. 2 A player chooses Strategy A with probability 0.350.35 and Strategy B with probability 1p1 - p. What is the probability of choosing Strategy B?
  3. 3 A random payoff is 1010 with probability 0.60.6 and 22 with probability 0.40.4. Find the expected payoff using E=pixiE = \sum p_i x_i.
  4. 4 Explain why an outcome with the largest total payoff does not always have to be a Nash equilibrium.