{"total":33,"rows":[{"id":"2112.04553","title":"Recent Advances in Reinforcement Learning in Finance","created":"2021-12-08","cited_by_count":110,"area":null},{"id":"2106.02684","title":"Learning Policies with Zero or Bounded Constraint Violation for Constrained MDPs","created":"2021-06-04","cited_by_count":80,"area":null},{"id":"2206.06270","title":"Near-Optimal Sample Complexity Bounds for Constrained MDPs","created":"2022-06-13","cited_by_count":37,"area":null},{"id":"2106.06239","title":"Safe Reinforcement Learning with Linear Function Approximation","created":"2021-06-11","cited_by_count":35,"area":null},{"id":"2112.00885","title":"DOPE: Doubly Optimistic and Pessimistic Exploration for Safe Reinforcement Learning","created":"2021-12-01","cited_by_count":35,"area":null},{"id":"2203.02638","title":"Safe Reinforcement Learning for Legged Locomotion","created":"2022-03-05","cited_by_count":35,"area":null},{"id":"2206.11889","title":"Provably Efficient Model-Free Constrained RL with Linear Function Approximation","created":"2022-06-23","cited_by_count":31,"area":null},{"id":"2202.00150","title":"Learning Infinite-Horizon Average-Reward Markov Decision Processes with Constraints","created":"2022-01-31","cited_by_count":29,"area":null},{"id":"2306.11700","title":"Last-Iterate Convergent Policy Gradient Primal-Dual Methods for Constrained MDPs","created":"2023-06-20","cited_by_count":28,"area":null},{"id":"2206.02346","title":"Convergence and sample complexity of natural policy gradient primal-dual methods for constrained MDPs","created":"2022-06-06","cited_by_count":27,"area":null},{"id":"2304.09362","title":"Long-Term Fairness with Unknown Dynamics","created":"2023-04-19","cited_by_count":27,"area":null},{"id":"2109.05439","title":"Concave Utility Reinforcement Learning with Zero-Constraint Violations","created":"2021-09-12","cited_by_count":19,"area":null},{"id":"2306.00212","title":"Provably Efficient Generalized Lagrangian Policy Optimization for Safe Multi-Agent Reinforcement Learning","created":"2023-05-31","cited_by_count":14,"area":null},{"id":"2206.14057","title":"Safe Exploration Incurs Nearly No Additional Sample Complexity for Reward-free RL","created":"2022-06-28","cited_by_count":10,"area":null},{"id":"2312.00561","title":"A safe exploration approach to constrained Markov decision processes","created":"2023-12-01","cited_by_count":10,"area":null},{"id":"2402.03077","title":"Markov Persuasion Processes: Learning to Persuade from Scratch","created":"2024-02-05","cited_by_count":8,"area":null},{"id":"2105.12204","title":"Safe Value Functions","created":"2021-05-25","cited_by_count":7,"area":null},{"id":"2301.11547","title":"Safe Posterior Sampling for Constrained MDPs with Bounded Constraint Violation","created":"2023-01-27","cited_by_count":6,"area":null},{"id":"2306.06265","title":"Near-optimal Conservative Exploration in Reinforcement Learning under Episode-wise Constraints","created":"2023-06-09","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":"2106.06680","title":"Markov Decision Processes with Long-Term Average Constraints","created":"2021-06-12","cited_by_count":3,"area":null},{"id":"2301.02389","title":"Provable Reset-free Reinforcement Learning by No-Regret Reduction","created":"2023-01-06","cited_by_count":3,"area":null},{"id":"2105.09295","title":"Online Selection of Diverse Committees","created":"2021-05-19","cited_by_count":2,"area":null},{"id":"2505.20010","title":"Data-Dependent Regret Bounds for Constrained MABs","created":"2025-05-26","cited_by_count":2,"area":null},{"id":"2602.14580","title":"Replicable Constrained Bandits","created":"2026-02-16","cited_by_count":2,"area":null},{"id":"2112.15221","title":"Constraint Sampling Reinforcement Learning: Incorporating Expertise For Faster Learning","created":"2021-12-30","cited_by_count":1,"area":null},{"id":"2209.03596","title":"An Empirical Evaluation of Posterior Sampling for Constrained Reinforcement Learning","created":"2022-09-08","cited_by_count":1,"area":null},{"id":"2407.05793","title":"A Primal-Dual Online Learning Approach for Dynamic Pricing of Sequentially Displayed Complementary Items under Sale Constraints","created":"2024-07-08","cited_by_count":1,"area":null},{"id":"2511.07486","title":"Provably Efficient Sample Complexity for Robust CMDP","created":"2025-11-10","cited_by_count":1,"area":null},{"id":"2305.00254","title":"Semi-Infinitely Constrained Markov Decision Processes and Efficient Reinforcement Learning","created":"2023-04-29","cited_by_count":0,"area":null},{"id":"2309.15395","title":"Model-Free, Regret-Optimal Best Policy Identification in Online CMDPs","created":"2023-09-27","cited_by_count":0,"area":null},{"id":"2309.15737","title":"Provably Efficient Exploration in Constrained Reinforcement Learning:Posterior Sampling Is All You Need","created":"2023-09-27","cited_by_count":0,"area":null},{"id":"2602.14543","title":"Truly Adapting to Adversarial Constraints in Constrained MABs","created":"2026-02-16","cited_by_count":0,"area":null}],"next_cursor":null}