Avrim Blum, Eyal Even-Dar, Katrina Ligett. Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing Games. Theory of Computing, 6(1):179-199, 2010. [doi]
@article{BlumEL10,
title = {Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing Games},
author = {Avrim Blum and Eyal Even-Dar and Katrina Ligett},
year = {2010},
doi = {10.4086/toc.2010.v006a008},
url = {http://dx.doi.org/10.4086/toc.2010.v006a008},
tags = {routing},
researchr = {https://researchr.org/publication/BlumEL10},
cites = {0},
citedby = {0},
journal = {Theory of Computing},
volume = {6},
number = {1},
pages = {179-199},
}