skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • NSF Public Access
  • Search Results
  • Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries

This content will become publicly available on June 30, 2026

Title: Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries
Award ID(s):
2141511 2023166
PAR ID:
10631558
Author(s) / Creator(s):
; ; ; ;
Publisher / Repository:
Conference on Learning Theory
Date Published:
ISSN:
2640-3498
Format(s):
Medium: X
Location:
Lyon, France
Sponsoring Org:
National Science Foundation
More Like this
No document suggestions found
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email