{"total":7,"rows":[{"id":"2410.07616","title":"The Plug-in Approach for Average-Reward and Discounted MDPs: Optimal Sample Complexity Analysis","created":"2024-10-10","cited_by_count":9,"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":"2606.16729","title":"Learning Policy from a Single Trajectory in Average-Reward Markov Decision Process","created":"2026-06-15","cited_by_count":3,"area":null},{"id":"2506.20910","title":"Faster Fixed-Point Methods for Multichain MDPs","created":"2025-06-26","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":"2602.00474","title":"Persistent-Transient Policy Evaluation for Markov Chains via Minimal Peripheral Quotients","created":"2026-01-31","cited_by_count":1,"area":null}],"next_cursor":null}