Maiti, A., Fan, Z., Jamieson, K., Ratliff, L. J., & Farina, G. (2025). Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries.
Citazione stile Chigago Style (17a edizione)Maiti, Arnab, Zhiyuan Fan, Kevin Jamieson, Lillian J. Ratliff, e Gabriele Farina. Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries. 2025.
Citatione MLA (9a ed.)Maiti, Arnab, et al. Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries. 2025.
Attenzione: Queste citazioni potrebbero non essere precise al 100%.