{"total":25,"rows":[{"id":"2106.07046","title":"Towards Tight Bounds on the Sample Complexity of Average-reward MDPs","created":"2021-06-13","cited_by_count":33,"area":null},{"id":"2205.05800","title":"Stochastic first-order methods for average-reward Markov decision processes","created":"2022-05-11","cited_by_count":32,"area":null},{"id":"2212.00603","title":"Near Sample-Optimal Reduction-based Policy Learning for Average Reward MDP","created":"2022-12-01","cited_by_count":29,"area":null},{"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":"2112.08451","title":"Quantum Algorithms for Reinforcement Learning with a Generative Model","created":"2021-12-15","cited_by_count":24,"area":null},{"id":"2201.09046","title":"Differentially Private SGDA for Minimax Problems","created":"2022-01-22","cited_by_count":23,"area":null},{"id":"2402.13903","title":"Dealing with unbounded gradients in stochastic saddle-point optimization","created":"2024-02-21","cited_by_count":16,"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":"2205.11168","title":"Logarithmic regret bounds for continuous-time average-reward Markov decision processes","created":"2022-05-23","cited_by_count":8,"area":null},{"id":"2210.12057","title":"Efficient Global Planning in Large MDPs via Stochastic Primal-Dual Optimization","created":"2022-10-21","cited_by_count":8,"area":null},{"id":"2201.12224","title":"Learning Stationary Nash Equilibrium Policies in $n$-Player Stochastic Games with Independent Chains","created":"2022-01-28","cited_by_count":7,"area":null},{"id":"2102.07120","title":"Long-Term Resource Allocation Fairness in Average Markov Decision Process (AMDP) Environment","created":"2021-02-14","cited_by_count":6,"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":"2207.06147","title":"A Near-Optimal Primal-Dual Method for Off-Policy Learning in CMDP","created":"2022-07-13","cited_by_count":5,"area":null},{"id":"2410.09568","title":"Second-Order Min-Max Optimization with Lazy Hessians","created":"2024-10-12","cited_by_count":5,"area":null},{"id":"2103.00299","title":"Primal-Dual Stochastic Mirror Descent for MDPs","created":"2021-02-27","cited_by_count":3,"area":null},{"id":"2303.12981","title":"Connected Superlevel Set in (Deep) Reinforcement Learning and its Application to Minimax Theorems","created":"2023-03-23","cited_by_count":3,"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":"2202.10506","title":"Accelerating Primal-dual Methods for Regularized Markov Decision Processes","created":"2022-02-21","cited_by_count":2,"area":null},{"id":"2502.15345","title":"Efficiently Solving Discounted MDPs with Predictions on Transition Matrices","created":"2025-02-21","cited_by_count":2,"area":null},{"id":"2103.09756","title":"Near Optimal Policy Optimization via REPS","created":"2021-03-17","cited_by_count":1,"area":null},{"id":"2312.01587","title":"Scalable and Independent Learning of Nash Equilibrium Policies in $n$-Player Stochastic Games with Unknown Independent Chains","created":"2023-12-04","cited_by_count":1,"area":null},{"id":"2603.16042","title":"Shuffling the Stochastic Mirror Descent via Dual Lipschitz Continuity and Kernel Conditioning","created":"2026-03-17","cited_by_count":1,"area":null}],"next_cursor":null}