The given matrix is:
\[ A = \begin{bmatrix} 2 & -1 \\ 1 & 1 \end{bmatrix}. \]
Compute successive powers of \(A\):
\[ A^2 = \begin{bmatrix} 2 & -1 \\ 1 & 1 \end{bmatrix} \begin{bmatrix} 2 & -1 \\ 1 & 1 \end{bmatrix} = \begin{bmatrix} 3 & -3 \\ 3 & 0 \end{bmatrix}. \]
\[ A^3 = A^2 \cdot A = \begin{bmatrix} 3 & -3 \\ 3 & 0 \end{bmatrix} \begin{bmatrix} 2 & -1 \\ 1 & 1 \end{bmatrix} = \begin{bmatrix} 3 & -6 \\ 6 & -3 \end{bmatrix}. \]
\[ A^4 = A^3 \cdot A = \begin{bmatrix} 3 & -6 \\ 6 & -3 \end{bmatrix} \begin{bmatrix} 2 & -1 \\ 1 & 1 \end{bmatrix} = \begin{bmatrix} 0 & -9 \\ 9 & -9 \end{bmatrix}. \]
\[ A^5 = A^4 \cdot A = \begin{bmatrix} 0 & -9 \\ 9 & -9 \end{bmatrix} \begin{bmatrix} 2 & -1 \\ 1 & 1 \end{bmatrix} = \begin{bmatrix} -9 & -9 \\ 9 & -18 \end{bmatrix}. \]
\[ A^6 = A^5 \cdot A = \begin{bmatrix} -9 & -9 \\ 9 & -18 \end{bmatrix} \begin{bmatrix} 2 & -1 \\ 1 & 1 \end{bmatrix} = \begin{bmatrix} -27 & 0 \\ 0 & -27 \end{bmatrix}. \]
\[ A^7 = A^6 \cdot A = \begin{bmatrix} -27 & 0 \\ 0 & -27 \end{bmatrix} \begin{bmatrix} 2 & -1 \\ 1 & 1 \end{bmatrix} = \begin{bmatrix} 36 & -27 \\ -27 & 36 \end{bmatrix}. \]
Observe that the diagonal elements of \(A^7\) are \(36\) and \(36\). Their sum is:
\[ \text{Sum of diagonal elements} = 36 + 36 = 72 = 3^2 \cdot 3^5 = 3^7. \]
Thus:\[ n = 7. \]
L | R | |
U | 0, 0 | 0, −c |
D | −c, 0 | 1 − c, 1 − c |
a | X | Y | Z |
M | 3, 1 | 0, 0 | −1, 2 |
N | 0, 0 | 1, 3 | 0.5, 1 |
Which set of strategy profiles survives iterated elimination of strictly dominated strategies?