New Milford, Connecticut - Document - PDFSEARCH.IO

First Page	Meta Content
	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 Document Date: 2012-12-13 11:40:02 Open Document File Size: 299,22 KB Share Result on Facebook

UPDATE

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 List