First Page | Document Content | |
---|---|---|
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 WebsiteFile Size: 299,22 KBShare Document on Facebook |