We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routing) based on Wardrop's model focus mostly on the static analysis of equilibria. In this paper, we ask the question whether the population of agents responsible for routing the traffic can jointly compute or better learn a Wardrop equilibrium efficiently. The rerouting policies that we study are of the following kind. In each round, each agent samples an alternative routing path and compares the latency on this path with its current latency. If the agent observes that it can improve its latency then it switches with some probability depending on the possible improvement to the better path.We can show various positive results based on a rerouting policy using an adaptive sampling rule that implicitly amplifies paths that carry a large amount of traffic in the Wardrop equilibrium. For general asymmetric games, we show that a simple replication protocol in which agents adopt strategies of more successful agents reaches a certain kind of bicriteria equilibrium within a time bound that is independent of the size and the structure of the network but only depends on a parameter of the latency functions, that we call the relative slope. For symmetric games, this result has an intuitive interpretation: Replication approximately satisfies almost everyone very quickly.In order to achieve convergence to a Wardrop equilibrium besides replication one also needs an exploration component discovering possibly unused strategies. We present a sampling based replication-exploration protocol and analyze its convergence time for symmetric games. For example, if the latency functions are defined by positive polynomials in coefficient representation, the convergence time is polynomial in the representation length of the latency functions. To the best of our knowledge, all previous results on the speed of convergence towards Wardrop equilibria, even when restricted to linear latency functions, were pseudopolynomial.In addition to the upper bounds on the speed of convergence, we can also present a lower bound demonstrating the necessity of adaptive sampling by showing that static sampling methods result in a slowdown that is exponential in the size of the network. A further lower bound illustrates that the relative slope is, in fact, the relevant parameter that determines the speed of convergence.

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Sanjeev Arora , Yuval Rabani , Umesh Vazirani, Simulating quadratic dynamical systems is PSPACE-complete (preliminary version), Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.459-467, May 23-25, 1994, Montreal, Quebec, Canada  [doi>10.1145/195058.195231]
	2	Baruch Awerbuch , Robert D. Kleinberg, Adaptive routing with end-to-end feedback: distributed learning and geometric approaches, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, June 13-16, 2004, Chicago, IL, USA  [doi>10.1145/1007352.1007367]
	3	B. Awerbuch and R. D. Kleinberg. Competitive collaborative learning. In Proc. 18th, pages 233--248, 2005.
	4	M. Beckmann, C. B. McGuire, and C. B. Winsten. Studies in the Economics and Transportation. Yale University Press, 1956.
	5	Petra Berenbrink , Tom Friedetzky , Leslie Ann Goldberg , Paul Goldberg , Zengjian Hu , Russell Martin, Distributed selfish load balancing, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, p.354-363, January 22-26, 2006, Miami, Florida  [doi>10.1145/1109557.1109597]
	6	Dimitri P. Bertsekas , John N. Tsitsiklis, Parallel and distributed computation: numerical methods, Prentice-Hall, Inc., Upper Saddle River, NJ, 1989
	7	A. Blum, E. Even-Dar, and K. Ligett. Routing without regret, 2005. Manuscript.
	8	Richard Cole , Yevgeniy Dodis , Tim Roughgarden, Pricing network edges for heterogeneous selfish users, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, June 09-11, 2003, San Diego, CA, USA  [doi>10.1145/780542.780618]
	9	Eyal Even-Dar , Yishay Mansour, Fast convergence of selfish rerouting, Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, January 23-25, 2005, Vancouver, British Columbia
	10	Alex Fabrikant , Christos Papadimitriou , Kunal Talwar, The complexity of pure Nash equilibria, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, June 13-16, 2004, Chicago, IL, USA  [doi>10.1145/1007352.1007445]
	11	S. Fischer and B. Vöcking. On the evolution of selfish routing. In Proc. 12th Ann. European Symp. on Algorithms (ESA), pages 323--334, 2004.
	12	Simon Fischer , Berthold Vöcking, Adaptive routing with stale information, Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, July 17-20, 2005, Las Vegas, NV, USA  [doi>10.1145/1073814.1073868]
	13	L. Fleischer. Linear tolls suffice: New bounds and algorithms for tolls in single source networks. In Proc. 31st Int. EATCS Coll. on Automata, Languages and Programming (ICALP), pages 544--554, 2004.
	14	A. Kaporis, E. Politopoulou, and P. Spirakis. The price of optimum in Stackelberg games. Technical report, Electronic Colloquium on Computational Complexity (ECCC), 2005.
	15	A. Khanna , J. Zinky, The revised ARPANET routing metric, Symposium proceedings on Communications architectures & protocols, p.45-56, September 25-27, 1989, Austin, Texas, United States
	16	James F. Kurose , Keith W. Ross, Computer Networking: A Top-Down Approach Featuring the Internet, Pearson Benjamin Cummings, 2004
	17	Michael Mitzenmacher, How useful is old information (extended abstract)?, Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, p.83-91, August 21-24, 1997, Santa Barbara, California, United States  [doi>10.1145/259380.259426]
	18	Y. Rabinovich, A. Sinclair, and A. Wigderson. Quadratic dynamical systems. In Proc. 33rd Ann. IEEE Symp. on Foundations of Comput. Sci. (FOCS), pages 304--313, 1992.
	19	J. Rexford. Handbook of Optimization in Telecommunications, chapter Route optimization in IP networks. Kluwer Academic Publishers, 2005.
	20	Tim Roughgarden, Stackelberg scheduling strategies, Proceedings of the thirty-third annual ACM symposium on Theory of computing, p.104-113, July 2001, Hersonissos, Greece  [doi>10.1145/380752.380783]
	21	Tim Roughgarden, How unfair is optimal routing?, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, p.203-204, January 06-08, 2002, San Francisco, California
	22	Tim Roughgarden , Éva Tardos, How bad is selfish routing?, Journal of the ACM (JACM), v.49 n.2, p.236-259, March 2002  [doi>10.1145/506147.506153]
	23	J. G. Wardrop. Some theoretical aspects of road traffic research. In Proc. of the Institute of Civil Engineers, Pt. II, pages 325--378, 1952.
	24	J. W. Weibull. Evolutionary Game Theory. MIT press, 1995.