\include{6896-template}
\begin{document}
%header --- replace with appropriate values
\lecture{1}{February 3, 2011}{John Doe}
%start notes here
\section{Preliminaries}
A two-player game is formally defined as follows.
\begin{definition}
A {\em 2-player game} is defined by a pair of $m \times n$ payoff matrices $(R, C)$, whose rows correspond to the strategies of one of the players of the game, called the {\em row player}, and whose columns correspond to the strategies of the other player, called the {\em column player}. The strategy sets of the row and column players are identified respectively with the sets $[m]:=\{1,\ldots,m\}$ and $[n]:=\{1,\ldots,n\}$.
\end{definition}
\noindent The following theorem was established by John Nash in 1951~\cite{Na}.
\begin{theorem}
Every game has a Nash equilibrium.
\end{theorem}
%%%% Bibliography goes here
\begin{thebibliography}{alpha}
\bibitem{Na} J.~Nash.
\newblock Noncooperative Games.
\newblock {\em Annals of Mathematics}, 54:289--295, 1951.
\end{thebibliography}
\end{document}