{"total":9,"rows":[{"id":"2307.08875","title":"Natural Actor-Critic for Robust Reinforcement Learning with Function Approximation","created":"2023-07-17","cited_by_count":36,"area":null},{"id":"2404.18909","title":"Sample-Efficient Robust Multi-Agent Reinforcement Learning in the Face of Environmental Uncertainty","created":"2024-04-29","cited_by_count":25,"area":null},{"id":"2411.11451","title":"Robust Markov Decision Processes: A Place Where AI and Formal Methods Meet","created":"2024-11-18","cited_by_count":18,"area":null},{"id":"2306.11626","title":"Soft Robust MDPs and Risk-Sensitive MDPs: Equivalence, Policy Gradient, and Sample Complexity","created":"2023-06-20","cited_by_count":17,"area":null},{"id":"2404.00099","title":"Efficient and Sharp Off-Policy Evaluation in Robust Markov Decision Processes","created":"2024-03-29","cited_by_count":3,"area":null},{"id":"2502.09432","title":"Dual Formulation for Non-Rectangular Lp Robust Markov Decision Processes","created":"2025-02-13","cited_by_count":3,"area":null},{"id":"2508.20315","title":"Multi-Agent Reinforcement Learning in Intelligent Transportation Systems: A Comprehensive Survey","created":"2025-08-27","cited_by_count":2,"area":null},{"id":"2602.11387","title":"Provably Efficient Algorithms for S- and Non-Rectangular Robust MDPs with General Parameterization","created":"2026-02-11","cited_by_count":1,"area":null},{"id":"2610.00325","title":"Bellman-Certified Rounding for Sparse Policy Deployment in MDPs","created":"2026-09-29","cited_by_count":0,"area":null}],"next_cursor":null}