\documentclass[12pt]{exam}
\usepackage{amsmath, amsthm, amssymb}
\usepackage{fullpage, paralist}
\usepackage{subfig}
\usepackage{graphicx}
\usepackage{enumerate}
\usepackage{enumitem}
\usepackage{multirow,array}
\newcommand{\Z}{{\mathbb Z}}
\newcommand{\Q}{{\mathbb Q}}
\newcommand{\R}{{\mathbb R}}
\newcommand{\C}{{\mathbb C}}
\newcommand{\A}{{\mathcal A}}
\newcommand{\I}{{\mathcal I}}
\newcommand{\ds}{\displaystyle}
\newcommand{\la}{\langle}
\newcommand{\ra}{\rangle}
\newtheorem{thm}{Theorem}[section]
\theoremstyle{remark}
\newtheorem*{nnremark}{Remark}
\printanswers
%\noprintanswers
\unframedsolutions
\begin{document}
\parskip=\medskipamount \thispagestyle{empty}
\centerline{Math 36 --- Daily Homework}
\centerline{Assigned: 10/29}
\centerline{Due: 11/1}
\begin{questions}
\question
Give an example of a game with three strategies for each player that has a single outcome after the iterated elimination of strictly dominated strategies.
\vspace{3 in}
Give an example of a game with three strategies for each player that has no strictly dominated strategies, but does have weakly dominated strategies such that using iterated elimination of weakly dominated strategies results in a single remaining outcome. Ensure that at any point, there is only one weakly dominated strategy to be eliminated (except the final step which will have to be eliminating a strictly dominated strategy), so there is no point where you have to choose which strategy to eliminate.
Does this seem reasonable for your game? Do you think rational players should ever choose a strategy other than the final outcome?
\end{questions}
\end{document}
%%% Local Variables:
%%% mode: latex
%%% TeX-master: t
%%% End: