Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries

Arnab Maiti*, Zhiyuan Fan*, Kevin Jamieson, Lillian J. Ratliff, Gabriele Farina

Bibtex entry

@inproceedings{Maiti25:Efficient, title={Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries}, author={Arnab Maiti and Zhiyuan Fan and Kevin Jamieson and Lillian J. Ratliff and Gabriele Farina}, booktitle={COLT 2025}, year={2025} }

Download

Paper PDF

Bibtex entry

@inproceedings{Maiti25:Efficient, title={Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries}, author={Arnab Maiti and Zhiyuan Fan and Kevin Jamieson and Lillian J. Ratliff and Gabriele Farina}, booktitle={COLT 2025}, year={2025} }

Typo or question?

Get in touch!
gfarina AT mit.edu

Metadata

Venue: COLT 2025
Topic: No-Regret Learning Dynamics