{"total":9,"rows":[{"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":"2304.14326","title":"A Best-of-Both-Worlds Algorithm for Constrained MDPs with Long-Term Constraints","created":"2023-04-27","cited_by_count":9,"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":"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":"2212.06357","title":"Scalable and Sample Efficient Distributed Policy Gradient Algorithms in Multi-Agent Networked Systems","created":"2022-12-13","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":"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":"2602.14543","title":"Truly Adapting to Adversarial Constraints in Constrained MABs","created":"2026-02-16","cited_by_count":0,"area":null}],"next_cursor":null}