Non-uniqueness of iterated elimination of weakly dominated strategies?
Consider the game below.

$$
\begin{array}{|r|c|c|}
\hline 
&amp;L&amp;R\\\hline
U&amp;5,1&amp;4,0\\\hline 
M&amp;6,0&amp;3,1\\\hline 
D&amp;6,4&amp;4,4\\\hline
\end{array}
$$

Both $U$ and $M$ are weakly dominated by $D$. 

If we start by deleting $U$. This would lead to the removal of $L$ in the next step. Then $M$ would be deleted. The solution would be $(D, R)$.

However, if we start by removing $M$, then $R$ would be removed next, and then $U$. The solution from deleting in this order is $(D, L)$.