11.3.1: Reduction by Dominance (Exercises)
-
-
Last updated
-
-
Save as PDF
-
Reduce the payoff matrix by dominance.
Find the optimal strategy for each player and the value of the game.
-
\(\left[\begin{array}{cc}
2 & -1 \\
0 & 3 \\
-2 & 0
\end{array}\right]\)
|
-
\(\left[\begin{array}{ll}
2 & 3 \\
4 & 5 \\
5 & 4
\end{array}\right]\)
|
-
\(\left[\begin{array}{ccc}
1 & 3 & -2 \\
-2 & 9 & 4 \\
-5 & 0 & 1
\end{array}\right]\)
|
-
\(\left[\begin{array}{lll}
0 & 1 & 1 \\
0 & 1 & 2 \\
1 & 2 & 4 \\
3 & 1 & 3
\end{array}\right]\)
|
-
\(\left[\begin{array}{cccc}
2 & 0 & -4 & 8 \\
0 & -6 & -6 & 2 \\
2 & -2 & 4 & 6 \\
-2 & -4 & -8 & 0
\end{array}\right]\)
|
-
\(\left[\begin{array}{cccc}
-1 & 3 & 2 & 4 \\
1 & 2 & 0 & 5
\end{array}\right]\)
|
-
\(\left[\begin{array}{cccc}
-5 & -1 & -1 & 3 \\
-10 & 1 & 2 & -8 \\
4 & 0 & 1 & 5 \\
3 & -8 & 0 & 5
\end{array}\right]\)
|
-
\(\left[\begin{array}{cccc}
1 & -3 & -4 & 1 \\
1 & -4 & -1 & 3 \\
1 & 1 & -1 & 1 \\
0 & -1 & 1 & 1
\end{array}\right]\)
|