Stochastic Online Shortest Path Routing: The Value of Feedback
From MaRDI portal
Publication:4567151
DOI10.1109/TAC.2017.2747409zbMath1390.90142arXiv1309.7367OpenAlexW2963554715MaRDI QIDQ4567151
Richard Combes, Alexandre Proutiere, Mikael Johansson, Zhenhua Zou, Mohammad Talebi
Publication date: 27 June 2018
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.7367
Stochastic programming (90C15) Stochastic network models in operations research (90B15) Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)
Related Items (4)
A combinatorial multi-armed bandit approach to correlation clustering ⋮ Differentially Private and Budget-Limited Bandit Learning over Matroids ⋮ A Lyapunov analysis of the continuous-time adaptive Bellman-Ford algorithm ⋮ Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights
This page was built for publication: Stochastic Online Shortest Path Routing: The Value of Feedback
