Selecting k Paths with the Minimum Longest Path Length in the Stochastic Semi-Bandit Setting
This study addresses an online problem in which paths from an origin vertex to a destination vertex must be selected at each time step within a network represented as a directed graph, and formulate the semi-bandit problem of selecting a set of paths to minimize the maximum traversal time among the selected paths.
Shunsuke Aoki, Atsuyoshi Nakamura
· 0 citations