Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks
暂无分享,去创建一个
[1] Paul W. Goldberg,et al. Distributed selfish load balancing , 2005, SODA '06.
[2] Berthold Vöcking,et al. Fast convergence to Wardrop equilibria by adaptive sampling methods , 2006, STOC '06.
[3] Berthold Vöcking,et al. On the Impact of Combinatorial Structure on Congestion Games , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[4] Yishay Mansour,et al. Convergence Time to Nash Equilibria , 2003, ICALP.
[5] R. Rosenthal. A class of games possessing pure-strategy Nash equilibria , 1973 .
[6] Yishay Mansour,et al. Fast convergence of selfish rerouting , 2005, SODA '05.
[7] Paul W. Goldberg,et al. Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game , 2004, PODC '04.
[8] Dana Randall,et al. Markov chain algorithms for planar lattice structures , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[9] Christos H. Papadimitriou,et al. The complexity of pure Nash equilibria , 2004, STOC '04.
[10] Vahab S. Mirrokni,et al. Convergence Issues in Competitive Games , 2004, APPROX-RANDOM.
[11] Yoav Shoham,et al. Fast and Compact: A Simple Class of Congestion Games , 2005, AAAI.
[12] Zengjian Hu,et al. A new analytical method for parallel, diffusion-type load balancing , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.
[13] Steve Chien,et al. Convergence to approximate Nash equilibria in congestion games , 2007, SODA '07.