Week 6: Practice

Find the Equilibria

Alice and Bob choose their actions secretly and at the same time. Alice chooses a row and Bob a column. Each cell lists Alice's payoff, then Bob's.

Question 1

Does either player have a dominant strategy? Does either have a dominated strategy?

Reveal the solution

Neither has a dominant strategy. Alice's best action changes from column to column: \(y\) against \(a\), \(z\) against \(b\) and \(d\), \(x\) against \(e\). Bob's best action changes from row to row.

Neither has a dominated strategy either. For each of Alice's rows, look for another row that beats it in every column. None does: for example, \(w\) gives 2 against \(a\), more than \(x\) and \(z\), and \(y\) beats \(w\) against \(a\) but loses against \(b\). The same check on Bob's columns finds no column that is beaten everywhere. So dominance can't solve this game.

Question 2

Find every pure-strategy Nash equilibrium.

Reveal the solution

Underline Alice's best payoff in each column and Bob's best payoff in each row.

  • Alice: \(y\) against \(a\), \(z\) against \(b\), \(w\) and \(x\) against \(c\) (both give 0), \(z\) against \(d\), \(x\) against \(e\).
  • Bob: \(b\) against \(w\), \(e\) against \(x\), \(c\) against \(y\), \(d\) against \(z\).

Both payoffs are shaded in two cells, so there are two Nash equilibria: \((x,e)\) with payoffs 10 and 9, and \((z,d)\) with payoffs 10 and 7.

A common error is \((y,a)\). Alice's 3 is her best payoff in column \(a\), but against \(y\) Bob would switch to \(c\) and get 6 instead of 5.

Question 3

Which equilibrium would each player prefer? What does that suggest about how the players might end up in one of them?

Reveal the solution

Alice gets 10 in both, so she doesn't mind which. Bob prefers \((x,e)\), 9 against 7. Since neither player loses from \((x,e)\) and Bob gains, a short conversation before the game, or a convention, could easily settle on it. Without one, each still has to guess the other's action, and a mismatch, such as \(x\) against \(d\), is costly for Bob.

Concept atlas