Yu, H., & Bertsekas, D. P. (2013). On Boundedness of Q-Learning Iterates for Stochastic Shortest Path Problems. Mathematics of Operations Research (INFORMS), 38(2), 209. https://doi.org/10.1287/moor.1120.0562
Chicago Style (17th ed.) CitationYu, Huizhen, and Dimitri P. Bertsekas. "On Boundedness of Q-Learning Iterates for Stochastic Shortest Path Problems." Mathematics of Operations Research (INFORMS) 38, no. 2 (2013): 209. https://doi.org/10.1287/moor.1120.0562.
MLA (9th ed.) CitationYu, Huizhen, and Dimitri P. Bertsekas. "On Boundedness of Q-Learning Iterates for Stochastic Shortest Path Problems." Mathematics of Operations Research (INFORMS), vol. 38, no. 2, 2013, p. 209, https://doi.org/10.1287/moor.1120.0562.
Warning: These citations may not always be 100% accurate.