{"total":15,"rows":[{"id":"2110.12727","title":"Learning Stochastic Shortest Path with Linear Function Approximation","created":"2021-10-25","cited_by_count":23,"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":"2112.09859","title":"Improved No-Regret Algorithms for Stochastic Shortest Path with Linear MDP","created":"2021-12-18","cited_by_count":14,"area":null},{"id":"2302.14004","title":"Optimistic Planning by Regularized Dynamic Programming","created":"2023-02-27","cited_by_count":8,"area":null},{"id":"2205.13044","title":"Near-Optimal Goal-Oriented Reinforcement Learning in Non-Stationary Environments","created":"2022-05-25","cited_by_count":6,"area":null},{"id":"2305.07911","title":"Delay-Adapted Policy Optimization and Improved Regret for Adversarial MDP with Delayed Bandit Feedback","created":"2023-05-13","cited_by_count":6,"area":null},{"id":"2205.13566","title":"Exploration, Exploitation, and Engagement in Multi-Armed Bandits with Abandonment","created":"2022-05-26","cited_by_count":5,"area":null},{"id":"2111.12045","title":"Adaptive Multi-Goal Exploration","created":"2021-11-23","cited_by_count":4,"area":null},{"id":"2210.04946","title":"Reaching Goals is Hard: Settling the Sample Complexity of the Stochastic Shortest Path","created":"2022-10-10","cited_by_count":4,"area":null},{"id":"2206.04921","title":"Offline Stochastic Shortest Path: Learning, Evaluation and Towards Optimality","created":"2022-06-10","cited_by_count":3,"area":null},{"id":"2210.09255","title":"A Unified Algorithm for Stochastic Path Problems","created":"2022-10-17","cited_by_count":1,"area":null},{"id":"2301.10993","title":"Multi-Agent Congestion Cost Minimization With Linear Function Approximations","created":"2023-01-26","cited_by_count":1,"area":null},{"id":"2402.08998","title":"Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path","created":"2024-02-14","cited_by_count":1,"area":null},{"id":"2306.04548","title":"Convergence of SARSA with linear function approximation: The random horizon case","created":"2023-06-07","cited_by_count":0,"area":null},{"id":"2511.04594","title":"Regret Lower Bounds for Decentralized Multi-Agent Stochastic Shortest Path Problems","created":"2025-11-06","cited_by_count":0,"area":null}],"next_cursor":null}