conftrace_

online shortest path

3 papers

Explore in graph

Co-occurring keywords · papers mentioning both

regret bound (2) multi-armed bandit (2) adversarial learning (2) path routing (1) centroid-based decomposition (1) adversarial mdp (1) label efficient (1) shortest path problem (1) directed acyclic graph (1) adaptive adversary (1)

Papers

Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries COLT 2025 Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions NeurIPS 2013 The On-Line Shortest Path Problem Under Partial Monitoring JMLR 2007