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 Routing

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 Routing Add to Reading List Source URL: rsrg.cms.caltech.edu Download Document from Source Website File Size: 299,22 KB Share Document on Facebook