Wang, S., Blanchet, J., & Glynn, P. (2023). Optimal Sample Complexity for Average Reward Markov Decision Processes.
Chicago Style (17th ed.) CitationWang, Shengbo, Jose Blanchet, and Peter Glynn. Optimal Sample Complexity for Average Reward Markov Decision Processes. 2023.
MLA (9th ed.) CitationWang, Shengbo, et al. Optimal Sample Complexity for Average Reward Markov Decision Processes. 2023.
Warning: These citations may not always be 100% accurate.