\begin{thebibliography}{10}

\bibitem{baird93advantage}
L.~C. Baird.
\newblock Advantage updating.
\newblock Technical report, Wright Laboratory, 1993.

\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{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{kearns99sparse}
M.~Kearns, Y.~Mansour, and A.~Y. Ng.
\newblock A sparse sampling algorithm for near-optimal planning in large markov
  decision processes.
\newblock {\em {IJCAI}}, pages 1324--1231, 1999.

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

\bibitem{puterman-book}
M.~Puterman.
\newblock {\em Markov decision processes : Discrete stochastic dynamic
  programming.}
\newblock John Wiley and Sons, 1994.

\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{sutton-book}
R.~S. Sutton and A.~G. Barto.
\newblock {\em Reinforcement Learning: An Introduction}.
\newblock MIT Press, 1998.

\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}
