\begin{thebibliography}{1}

\bibitem{bartlett00estimation}
P.~Bartlett and J.~Baxter.
\newblock Estimation and approximation bounds for gradient-based reinforcement
  learning.
\newblock Technical report, Australian National University, 2000.

\bibitem{bertsekas-book}
D.~P. Bertsekas.
\newblock {\em Dynamic Programming and Optimal Control, Volumes 1 and 2}.
\newblock Athena Scientific, 1995.

\bibitem{neuro-programming}
D.~P. Bertsekas and J.~N. Tsitsiklis.
\newblock {\em Neuro-Dynamic Programming}.
\newblock Athena Scientific, 1996.

\bibitem{Sham_colt}
S.~Kakade.
\newblock Optimizing average reward using discounted rewards.
\newblock {\em In Proc. of Computational Learning Theory}, 2001.

\bibitem{meuleau01exploration}
L.~Peshkin an K.~Kim N.~Meuleau.
\newblock Exploration in gradient-based reinforcement learning.
\newblock Technical report, Massachusetts Institute of Technology, 2001.

\bibitem{sutton-off-policy}
D.~Precup, R.~Sutton, and S.~Dasgupta.
\newblock Off-policy temporal-difference learning with function approximation.
\newblock {\em ICML, in press}, 2001.

\bibitem{sutton99policy}
R.~Sutton, D.~McAllester, S.~Singh, and Y.~Mansour.
\newblock Policy gradient methods for reinforcement learning with function
  approximation.
\newblock {\em Neural Information Processing Systems}, 13, 2000.

\bibitem{thrun92efficient}
S.~B. Thrun.
\newblock Efficient exploration in reinforcement learning.
\newblock Technical report, Carnegie Mellon University, 1992.

\bibitem{whitehead91complexity}
S.~D. Whitehead.
\newblock Complexity and cooperation in q-learning.
\newblock {\em Proc. 8th International Conf. on Machine Learning}, pages
  363--367, 1991.

\end{thebibliography}
