{"total":15,"rows":[{"id":"2306.16394","title":"Sharper Model-free Reinforcement Learning for Average-reward Markov Decision Processes","created":"2023-06-28","cited_by_count":29,"area":null},{"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":"2310.08833","title":"Optimal Sample Complexity for Average Reward Markov Decision Processes","created":"2023-10-13","cited_by_count":15,"area":null},{"id":"2302.00036","title":"Reducing Blackwell and Average Optimality to Discounted MDPs via the Blackwell Discount Factor","created":"2023-01-31","cited_by_count":13,"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":"2302.07477","title":"Optimal Sample Complexity of Stable Discounted Markov Decision Processes","created":"2023-02-15","cited_by_count":6,"area":null},{"id":"2404.12648","title":"Sample-efficient Learning of Infinite-horizon Average-reward MDPs with General Function Approximation","created":"2024-04-19","cited_by_count":6,"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":"2502.11238","title":"Span-Agnostic Optimal Sample Complexity and Oracle Inequalities for Average-Reward RL","created":"2025-02-16","cited_by_count":5,"area":null},{"id":"2509.16586","title":"Near-Optimal Sample Complexity Bounds for Constrained Average-Reward MDPs","created":"2025-09-20","cited_by_count":4,"area":null},{"id":"2506.20910","title":"Faster Fixed-Point Methods for Multichain MDPs","created":"2025-06-26","cited_by_count":2,"area":null},{"id":"2608.06545","title":"Robust Average-Reward Markov Decision Processes: Minimax-Optimal Learning via Plug-in Reductions","created":"2026-08-06","cited_by_count":2,"area":null},{"id":"2602.11387","title":"Provably Efficient Algorithms for S- and Non-Rectangular Robust MDPs with General Parameterization","created":"2026-02-11","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":"2606.27448","title":"Learning in Markovian bandits with non-observable states and constrained decision epochs","created":"2026-06-25","cited_by_count":0,"area":null}],"next_cursor":null}