[77] Tengyu Xu, Yingbin Liang, and Guanghui Lan. CRPO: A new approach for safe reinforcement learning with convergence guarantee. In Proceedings of the International Conference on Machine Learning, pages 11480-11491, 2021.
[78] Yongshuai Liu, Jiaxin Ding, and Xin Liu. IPO: Interior-point policy optimization under constraints. In Proceedings of the AAAI Aonference on Artificial Intelligence, volume 34, pages 4940-4947, 2020.
[79] Yonathan Efroni, Shie Mannor, and Matteo Pirotta. Exploration-exploitation in constrained MDPs. arXiv preprint arXiv:2003.02189, 2020.
[80] Dongsheng Ding, Xiaohan Wei, Zhuoran Yang, Zhaoran Wang, and Mihailo R Jovanovic. Provably efficient safe exploration via primal-dual policy optimization. In Proceedings of the International Conference on Artificial Intelligence and Statistics, pages 3304-3312, 2021.
[81] Liuyuan Zheng and Lillian Ratliff. Constrained upper confidence reinforcement learning. In Proceedings of the Learning for Dynamics and Control, pages 620-629, 2020.
[82] Shuang Qiu, Xiaohan Wei, Zhuoran Yang, Jieping Ye, and Zhaoran Wang. Upper confidence primal-dual reinforcement learning for CMDP with adversarial loss. In Proceedings of the Advances in Neural Information Processing Systems, volume 33, pages 15277-15287, 2020.
[83] Kianté Brantley, Miro Dudik, Thodoris Lykouris, Sobhan Miryoosefi, Max Simchowitz, Aleksandrs Slivkins, and Wen Sun. Constrained episodic reinforcement learning in concave-convex and knapsack settings. In Proceedings of the Advances in Neural Information Processing Systems, volume 33, pages 16315–16326, 2020.
[84] Tiancheng Yu, Yi Tian, Jingzhao Zhang, and Suvrit Sra. Provably efficient algorithms for multi-objective competitive RL. In Proceedings of the International Conference on Machine Learning, pages 12167-12176, 2021.
[85] Thiago D Simão, Nils Jansen, and Matthijs TJ Spaan. AlwaysSafe: Reinforcement learning without safety constraint violations during training. In Proceedings of the 20th International Conference on Autonomous Agents and Multi-Agent Systems, pages 1226-1235, 2021.
[86] Krishna C Kalagarla, Rahul Jain, and Pierluigi Nuzzo. A sample-efficient algorithm for episodic finite-horizon MDP with constraints. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 35, pages 8030-8037, 2021.
[87] Sobhan Miryoosefi and Chi Jin. A simple reward-free approach to constrained reinforcement learning. In Proceedings of the International Conference on Machine Learning, pages 15666-15698, 2022.
[88] Honghao Wei, Xin Liu, and Lei Ying. A provably-efficient model-free algorithm for infinite-horizon average-reward constrained Markov decision processes. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 36, pages 3868-3876, 2022.
[89] Liyu Chen, Rahul Jain, and Haipeng Luo. Learning infinite-horizon average-reward Markov decision process with constraints. In Proceedings of the International Conference on Machine Learning, pages 3246-3270, 2022.
[90] Archana Bura, Aria HasanzadeZonuzy, Dileep Kalathil, Srinivas Shakkottai, and Jean-Francois Chamberland. DOPE: Doubly optimistic and pessimistic exploration for safe reinforcement learning. In Proceedings of the Advances in Neural Information Processing Systems, volume 35, pages 1047-1059, 2022.
[91] Arnob Ghosh, Xingyu Zhou, and Ness Shroff. Provably efficient model-free constrained RL with linear function approximation. In Proceedings of the Advances in Neural Information Processing Systems, 2022.