Routing without regret: On convergence to nash equilibria of regret-minimizing algorithms in routing games (2006)

by A Blum, E Even-Dar, K Ligett
Venue:In Symposium on Principles of Distributed Computing (PODC