"Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed ..."

Arnab Maiti et al. (2025)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2025-08-19

- view
  - electronic edition @ mlr.press (open access)
- export record
  dblp key:
  - conf/colt/MaitiFJRF25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/colt/MaitiFJRF25
Arnab Maiti, Zhiyuan Fan, Kevin G. Jamieson, Lillian J. Ratliff, Gabriele Farina:
Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries. COLT 2025: 3881-3932

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.