Fast Routing under Uncertainty: Adaptive Learning in Congestion Games via Exponential Weights

We examine an adaptive learning framework for nonatomic congestion games where the players' cost functions may be subject to exogenous fluctuations (e.g., due to disturbances in the network, variations in the traffic going through a link, etc.). In this setting, the popular multiplicative / exponential weights algorithm enjoys an O(1/ √ T ) equilibrium convergence rate; however, this rate is suboptimal in static environments -i.e., when the network is not subject to randomness. In this static regime, accelerated algorithms achieve an O(1/T 2 ) convergence speed, but they fail to converge altogether in stochastic problems. To fill this gap, we propose a novel, adaptive exponential weights method -dubbed ADAWEIGHTthat seamlessly interpolates between the O(1/T 2 ) and O(1/ √ T ) rates in static and stochastic environments respectively. Importantly, this "best-of-both-worlds" guarantee does not require any prior knowledge of the problem's parameters or any tuning by the optimizer; in addition, the method's convergence speed depends subquadratically on the size of the network (number of vertices and edges), so it scales gracefully to large, real-life urban networks.