Stochastic Online Shortest Path Routing: The Value of Feedback

v1v2v3v4v5 (latest)

Stochastic Online Shortest Path Routing: The Value of Feedback

27 September 2013

M. Sadegh Talebi

Alexandre Proutiere

ArXiv (abs)PDF HTML

Papers citing "Stochastic Online Shortest Path Routing: The Value of Feedback"

6 / 6 papers shown

Title
A Combinatorial Semi-Bandit Approach to Charging Station Selection for Electric Vehicles Niklas Åkerblom M. Chehreghani 48 0 0 17 Jan 2023
Active Exploration via Experiment Design in Markov Chains Mojmír Mutný Tadeusz Janik Andreas Krause 87 16 0 29 Jun 2022
Distributed Bandits with Heterogeneous Agents Lin Yang Y. Chen Mohammad Hajiesmaili John C. S. Lui Don Towsley 85 22 0 23 Jan 2022
Online Learning of Energy Consumption for Navigation of Electric Vehicles Niklas Åkerblom Yuxin Chen M. Chehreghani 41 12 0 03 Nov 2021
Online Learning of Network Bottlenecks via Minimax Paths Niklas Åkerblom F. Hoseini M. Chehreghani 74 11 0 17 Sep 2021
Contextual Recommendations and Low-Regret Cutting-Plane Algorithms Sreenivas Gollapudi Guru Guruganesh Kostas Kollias Pasin Manurangsi R. Leme Jon Schneider 52 5 0 09 Jun 2021