![](https://www.pdfsearch.io/img/807f0ff9648143fd9dee7212fbda137a.jpg) Date: 2012-12-13 11:40:02
| | T HEORY OF C OMPUTING, Volume), pp. 179–199 www.theoryofcomputing.org Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in RoutingAdd to Reading ListSource URL: rsrg.cms.caltech.eduDownload Document from Source Website File Size: 299,22 KBShare Document on Facebook
|