{"total":7,"rows":[{"id":"2403.11477","title":"Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs","created":"2024-03-18","cited_by_count":17,"area":null},{"id":"2405.17108","title":"Finding good policies in average-reward Markov Decision Processes without prior knowledge","created":"2024-05-27","cited_by_count":13,"area":null},{"id":"2311.13469","title":"Span-Based Optimal Sample Complexity for Average Reward MDPs","created":"2023-11-22","cited_by_count":5,"area":null},{"id":"2505.15342","title":"Policy Testing in Markov Decision Processes","created":"2025-05-21","cited_by_count":2,"area":null},{"id":"2510.13476","title":"Towards Blackwell Optimality: Bellman Optimality Is All You Can Get","created":"2025-10-15","cited_by_count":1,"area":null},{"id":"2606.14095","title":"Lyapunov-Based Sample Complexity Analysis for Weakly-Coupled MDPs","created":"2026-06-12","cited_by_count":0,"area":null},{"id":"2610.04117","title":"Sharp Convergence and Sample Complexity of Policy Mirror Descent for Average-Reward MDPs","created":"2026-10-02","cited_by_count":0,"area":null}],"next_cursor":null}