{"total":15,"rows":[{"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":"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":"2208.10458","title":"Minimax-Optimal Multi-Agent RL in Markov Games With a Generative Model","created":"2022-08-22","cited_by_count":15,"area":null},{"id":"2209.13694","title":"Safe Linear Bandits over Unknown Polytopes","created":"2022-09-27","cited_by_count":14,"area":null},{"id":"2306.12774","title":"Pure Exploration in Bandits with Linear Constraints","created":"2023-06-22","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":"2306.07749","title":"Provably Learning Nash Policies in Constrained Markov Potential Games","created":"2023-06-13","cited_by_count":7,"area":null},{"id":"2302.02426","title":"Online Nonstochastic Control with Adversarial and Static Constraints","created":"2023-02-05","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":"2312.17229","title":"Think Before You Duel: Understanding Complexities of Preference Learning under Constrained Resources","created":"2023-12-28","cited_by_count":3,"area":null},{"id":"2406.02165","title":"SaVeR: Optimal Data Collection Strategy for Safe Policy Evaluation in Tabular MDP","created":"2024-06-04","cited_by_count":3,"area":null},{"id":"2311.01568","title":"Anytime-Competitive Reinforcement Learning with Policy Prior","created":"2023-11-02","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":"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}],"next_cursor":null}