The Lemke-Howson algorithm - exercises
- Define the Lemke-Howson algorithm
- Draw the best response polytopes and use the Lemke-Howson algorithm (with all possible starting labels) for the following games:
- $
A =
\begin{pmatrix}
3 & -1\\
2 & 7\end{pmatrix}
\qquad
B =
\begin{pmatrix}
-3 & 1\\
1 & -6\end{pmatrix}
$
- $
A =
\begin{pmatrix}
2 & -1\\
1 & 3\end{pmatrix}
\qquad
B =
\begin{pmatrix}
-2 & 2\\
1 & -2\end{pmatrix}
$
- Use the tableaux representation to execute the Lemke-Howson algorithm (using starting label: 0) on the games of question 2.