Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

42

TOC
2010

favoriteEmaildiscussreport

132views Management» more TOC 2010»

Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing Games

13 years 5 months ago

Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing Games

Download toc.cse.iitk.ac.in

Avrim Blum, Eyal Even-Dar, Katrina Ligett

Real-time Traffic

Management | TOC 2010 |

claim paper

Related Content

» Generalized Sampling and Variance in Counterfactual Regret Minimization

» Fast convergence to Wardrop equilibria by adaptive sampling methods

» DARD Distributed Adaptive Routing for Datacenter Networks

Post Info
More Details (n/a)

Added	22 May 2011
Updated	22 May 2011
Type	Journal
Year	2010
Where	TOC
Authors	Avrim Blum, Eyal Even-Dar, Katrina Ligett

Comments (0)