Fast convergence to Wardrop equilibria by adaptive sampling methods
暂无分享,去创建一个
Berthold Vöcking | Harald Räcke | Simon Fischer | Harald Räcke | Berthold Vöcking | S. Fischer | Simon Fischer
[1] Tim Roughgarden,et al. How unfair is optimal routing? , 2002, SODA '02.
[2] Paul G. Spirakis,et al. The Price of Optimum in Stackelberg Games , 2005, Electron. Colloquium Comput. Complex..
[3] Yuval Rabani,et al. Simulating quadratic dynamical systems is PSPACE-complete (preliminary version) , 1994, STOC '94.
[4] Berthold Vöcking,et al. On the Evolution of Selfish Routing , 2004, ESA.
[5] J. G. Wardrop,et al. Some Theoretical Aspects of Road Traffic Research , 1952 .
[6] Paul W. Goldberg,et al. Distributed selfish load balancing , 2005, SODA '06.
[7] Michael Mitzenmacher,et al. How Useful Is Old Information? , 2000, IEEE Trans. Parallel Distributed Syst..
[8] Tim Roughgarden,et al. How bad is selfish routing? , 2002, JACM.
[9] Avi Wigderson,et al. Quadratic dynamical systems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[10] Christos H. Papadimitriou,et al. The complexity of pure Nash equilibria , 2004, STOC '04.
[11] Baruch Awerbuch,et al. Adaptive routing with end-to-end feedback: distributed learning and geometric approaches , 2004, STOC '04.
[12] Michael Mitzenmacher,et al. How useful is old information (extended abstract)? , 1997, PODC '97.
[13] H. Hurley. computer networking. , 1996, Ostomy/wound management.
[14] Tim Roughgarden,et al. How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[15] Avrim Blum,et al. Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games , 2006, PODC '06.
[16] Yishay Mansour,et al. Fast convergence of selfish rerouting , 2005, SODA '05.
[17] Panos M. Pardalos,et al. Handbook of Optimization in Telecommunications , 2006 .
[18] Tim Roughgarden,et al. Stackelberg scheduling strategies , 2001, STOC '01.
[19] Jörgen W. Weibull,et al. Evolutionary Game Theory , 1996 .
[20] Lisa Fleischer,et al. Linear tolls suffice: New bounds and algorithms for tolls in single source networks , 2005, Theor. Comput. Sci..
[21] A. Khanna,et al. The revised ARPANET routing metric , 1989, SIGCOMM '89.
[22] Keith W. Ross,et al. Computer networking - a top-down approach featuring the internet , 2000 .
[23] Berthold Vöcking,et al. Adaptive routing with stale information , 2005, PODC '05.
[24] Baruch Awerbuch,et al. Competitive collaborative learning , 2005, J. Comput. Syst. Sci..
[25] Richard Cole,et al. Pricing network edges for heterogeneous selfish users , 2003, STOC '03.