{"total":25,"rows":[{"id":"2205.10330","title":"A Review of Safe Reinforcement Learning: Methods, Theory and Applications","created":"2022-05-20","cited_by_count":181,"area":null},{"id":"2109.06332","title":"Achieving Zero Constraint Violation for Constrained Reinforcement Learning via Primal-Dual Approach","created":"2021-09-13","cited_by_count":50,"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":"2209.08025","title":"Trustworthy Reinforcement Learning Against Intrinsic Vulnerabilities: Robustness, Safety, and Generalizability","created":"2022-09-16","cited_by_count":36,"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":"2107.05216","title":"A Simple Reward-free Approach to Constrained Reinforcement Learning","created":"2021-07-12","cited_by_count":30,"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":"2304.09362","title":"Long-Term Fairness with Unknown Dynamics","created":"2023-04-19","cited_by_count":27,"area":null},{"id":"2102.03192","title":"Provably Efficient Algorithms for Multi-Objective Competitive RL","created":"2021-02-05","cited_by_count":22,"area":null},{"id":"2509.25849","title":"Knapsack RL: Unlocking Exploration of LLMs via Optimizing Budget Allocation","created":"2025-09-30","cited_by_count":22,"area":null},{"id":"2303.05733","title":"Provably Efficient Model-Free Algorithms for Non-stationary CMDPs","created":"2023-03-10","cited_by_count":21,"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":"2106.01577","title":"A Provably-Efficient Model-Free Algorithm for Constrained Markov Decision Processes","created":"2021-06-03","cited_by_count":17,"area":null},{"id":"2302.04375","title":"A Near-Optimal Algorithm for Safe Reinforcement Learning Under Instantaneous Hard Constraints","created":"2023-02-08","cited_by_count":17,"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":"2211.03994","title":"Reinforcement Learning with Stepwise Fairness Constraints","created":"2022-11-08","cited_by_count":9,"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":"2311.05511","title":"Anytime-Constrained Reinforcement Learning","created":"2023-11-09","cited_by_count":6,"area":null},{"id":"2302.01517","title":"Pseudonorm Approachability and Applications to Regret Minimization","created":"2023-02-03","cited_by_count":5,"area":null},{"id":"2506.13244","title":"No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need!","created":"2025-06-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":"2209.03596","title":"An Empirical Evaluation of Posterior Sampling for Constrained Reinforcement Learning","created":"2022-09-08","cited_by_count":1,"area":null},{"id":"2410.23637","title":"Anytime-Constrained Equilibria in Polynomial Time","created":"2024-10-31","cited_by_count":1,"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}],"next_cursor":null}