Abstract In this paper, we study bottleneck identification in networks via extracting minimax paths. Many real-world have stochastic weights for which full knowledge is not available advance. Therefore, model task as a combinatorial semi-bandit problem to apply version of Thompson Sampling and establish an upper bound on the corresponding Bayesian regret. Due computational intractability proble...