\begin{thebibliography}{16}
\expandafter\ifx\csname natexlab\endcsname\relax\def\natexlab#1{#1}\fi
\expandafter\ifx\csname url\endcsname\relax
  \def\url#1{{\tt #1}}\fi

\bibitem[Aumann(1974)]{aumann74}
R.J. Aumann.
\newblock Subjectivity and correlation in randomized strategies.
\newblock {\em Journal of Mathematical Economics}, 1, 1974.

\bibitem[Aumann(1987)]{aumann87}
R.J. Aumann.
\newblock Correlated equilibrium as an expression of {B}ayesian rationality.
\newblock {\em Econometrica}, 55, 1987.

\bibitem[Berger et~al.(1996)Berger, Pietra, and Pietra]{Bergeretal96}
A.~Berger, S.~Della Pietra, and V.~Della Pietra.
\newblock A maximum entropy approach to natural language processing.
\newblock {\em Computational Linguistics}, 22\penalty0 (1), March 1996.

\bibitem[Dawid and Lauritzen(1993)]{DawidandLauritzen93}
A.~P. Dawid and S.~L. Lauritzen.
\newblock Hyper {M}arkov laws in the statistical analysis of decomposable
  graphical models.
\newblock {\em The Annals of Statistics}, 21\penalty0 (3):\penalty0 1271--1317,
  September 1993.

\bibitem[Dyer et~al.(1991)Dyer, Frieze, and Kannan]{dyer91}
M.~Dyer, A.~Frieze, and R.~Kannan.
\newblock A random polynomial time algorithm for approximating the volume of a
  convex body.
\newblock {\em JACM}, 38\penalty0 (1):\penalty0 1--17, 1991.

\bibitem[Foster and Vohra(1997)]{foster97}
D.~Foster and R.~Vohra.
\newblock Calibrated learning and correlated equilibrium.
\newblock {\em Games and Economic Behavior}, 1997.

\bibitem[Foster and Vohra(1999)]{foster99}
D.~Foster and R.~Vohra.
\newblock Regret in the on-line decision problem.
\newblock {\em Games and Economic Behavior}, pages 7 -- 36, 1999.

\bibitem[Kearns et~al.(2001)Kearns, Littman, and Singh]{kearns01}
M.~Kearns, M.~Littman, and S.~Singh.
\newblock Graphical models for game theory.
\newblock In {\em Proceedings of the Conference on Uncertainty in Artificial
  Intelligence}, pages 253--260, 2001.

\bibitem[Koller and Milch(2001)]{koller01}
Daphne Koller and Brian Milch.
\newblock Multi-agent influence diagrams for representing and solving games.
\newblock Submitted, 2001.

\bibitem[Littman et~al.(2002)Littman, Kearns, and Singh]{littman02}
M.~Littman, M.~Kearns, and S.~Singh.
\newblock An efficient exact algorithm for singly connected graphical games.
\newblock In {\em Neural Information Processing Systems}, 2002.

\bibitem[Mura(2000)]{lamura00}
P.~La Mura.
\newblock Game networks.
\newblock In {\em Proceedings of the 16th Conference on Uncertainty in
  Artificial Intelligence (UAI)}, pages 335--342, 2000.

\bibitem[Nash(1951)]{nash51}
J.~F. Nash.
\newblock Non-cooperative games.
\newblock {\em Annals of Mathematics}, 54:\penalty0 286--295, 1951.

\bibitem[Ortiz and Kearns(2003)]{ortiz03}
L.~Ortiz and M.~Kearns.
\newblock Nash propagation for loopy graphical games.
\newblock In {\em Neural Information Processing Systems}, 2003.
\newblock To appear.

\bibitem[Owen(1995)]{owen95}
G.~Owen.
\newblock {\em Game Theory}.
\newblock Academic Press, UK, 1995.

\bibitem[Pearl(1988)]{pearl88}
J.~Pearl.
\newblock {\em Probabilistic Reasoning in Intelligent Systems}.
\newblock Morgan Kaufmann, 1988.

\bibitem[Vickrey and Koller(2002)]{Vickrey02}
D.~Vickrey and D.~Koller.
\newblock Multi-agent algorithms for solving graphical games.
\newblock In {\em Proceedings of the National Conference on Artificial
  Intelligence (AAAI)}, 2002.
\newblock To appear.

\end{thebibliography}
