{"total":28,"rows":[{"id":"2104.11186","title":"Stochastic Shortest Path: Minimax, Parameter-Free and Towards Horizon-Free Regret","created":"2021-04-22","cited_by_count":34,"area":null},{"id":"2202.00150","title":"Learning Infinite-Horizon Average-Reward Markov Decision Processes with Constraints","created":"2022-01-31","cited_by_count":29,"area":null},{"id":"2106.08377","title":"Implicit Finite-Horizon Approximation and Efficient Optimal Algorithms for Stochastic Shortest Path","created":"2021-06-15","cited_by_count":23,"area":null},{"id":"2110.12727","title":"Learning Stochastic Shortest Path with Linear Function Approximation","created":"2021-10-25","cited_by_count":23,"area":null},{"id":"2201.13172","title":"Near-Optimal Regret for Adversarial MDP with Delayed Bandit Feedback","created":"2022-01-31","cited_by_count":22,"area":null},{"id":"2106.05335","title":"Online Learning for Stochastic Shortest Path Model via Posterior Sampling","created":"2021-06-09","cited_by_count":16,"area":null},{"id":"2105.01593","title":"Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation","created":"2021-05-04","cited_by_count":15,"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":"2202.03334","title":"Policy Optimization for Stochastic Shortest Path","created":"2022-02-07","cited_by_count":13,"area":null},{"id":"2303.01464","title":"Efficient Rate Optimal Regret for Adversarial Contextual MDPs Using Online Function Approximation","created":"2023-03-02","cited_by_count":9,"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":"2408.15158","title":"Delay as Payoff in MAB","created":"2024-08-27","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":"2201.13170","title":"Cooperative Online Learning in Stochastic and Adversarial MDPs","created":"2022-01-31","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":"2302.03608","title":"Online Reinforcement Learning with Uncertain Episode Lengths","created":"2023-02-07","cited_by_count":4,"area":null},{"id":"2408.17286","title":"Risk-averse Total-reward MDPs with ERM and EVaR","created":"2024-08-30","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":"2511.00637","title":"Stochastic Shortest Path with Sparse Adversarial Costs","created":"2025-11-01","cited_by_count":1,"area":null},{"id":"2208.00330","title":"Convex duality for stochastic shortest path problems in known and unknown environments","created":"2022-07-31","cited_by_count":0,"area":null},{"id":"2503.05963","title":"Bayesian Graph Traversal","created":"2025-03-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},{"id":"2608.17703","title":"Dijkstra as an Oracle for Online Stochastic Shortest Path Navigation with Provable Guarantees","created":"2026-08-18","cited_by_count":0,"area":null}],"next_cursor":null}