Maiti, Arnab, Fan, Zhiyuan, Jamieson, Kevin G, Ratliff, Lillian J, and Farina, Gabriele. Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries. Retrieved from https://par.nsf.gov/biblio/10644784.

Maiti, Arnab, Fan, Zhiyuan, Jamieson, Kevin G, Ratliff, Lillian J, & Farina, Gabriele. Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries. Retrieved from https://par.nsf.gov/biblio/10644784.

Maiti, Arnab, Fan, Zhiyuan, Jamieson, Kevin G, Ratliff, Lillian J, and Farina, Gabriele. "Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries". Country unknown/Code not available: Proceedings of Thirty Eighth Conference on Learning Theory, PMLR. https://par.nsf.gov/biblio/10644784.

@article{osti_10644784,
place = {Country unknown/Code not available}, title = {Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries}, url = {https://par.nsf.gov/biblio/10644784}, abstractNote = {}, journal = {}, publisher = {Proceedings of Thirty Eighth Conference on Learning Theory, PMLR}, author = {Maiti, Arnab and Fan, Zhiyuan and Jamieson, Kevin G and Ratliff, Lillian J and Farina, Gabriele}, }