Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4698 LNCS, Issue , 2007, Pages 41-52

  Berenbrink, Petra ^a   Friedetzky, Tom ^b   Hajirasouliha, Iman ^a   Hu, Zengjian ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

^b DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; PROBLEM SOLVING; ROUTING PROTOCOLS;

REALLOCATION ALGORITHMS; UNIFORM RESOURCES;

DISTRIBUTED DATABASE SYSTEMS;

EID: 84975883789     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75520-3_6     Document Type: Conference Paper

References (12)

1. Ackermann, H., Röglin, H., Vöcking, B.: On the Impact of Combinatorial Structure on Congestion Games. In: Proc. 47th IEEE Annual Symposium on Foundations of Computing Science (FOCS), pp. 613-622. IEEE Computer Society Press, Los Alamitos (2006)
2. Berenbrink, P., Friedetzky, T., Goldberg, L.A., Goldberg, P., Hu, Z., Martin, R.: Distributed selfish load balancing. In: Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 354-363 (2006)
3. Berenbrink, P., Friedetzky, T., Hu, Z.: A new analytical method for parallel, diffusion-type load balancing. In: Proc. 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 1-10 (2006)
4. Chien, S., Sinclair, A.: Convergence to Approximate Nash Equilibria in Congestion Games. In: Proc. 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 169-178 (2007)
5. Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence Time to Nash Equilibria. In: Baeten, J.CM., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 502-513. Springer, Heidelberg (2003)
6. Even-Dar, E., Mansour, Y.: Fast Convergence of Selfish Rerouting. In: Proc. 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 772-781 (2005)
7. Fabricant, A., Papadimitriou, C.H., Talwar, K.: The Complexity of Pure Nash Equilibria. In: Proc. 36th Annual Symposium on Theory of Computing (STOC), pp. 604-612 (2004)
8. Fischer, S., Räcke, H., Vöcking, B.: Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods. In: Proc. 38th Annual Symposium on Theory of Computing (STOC), pp. 653-662. Seattle, WA (2006)
9. Goemans, M.X., Mirrokni, V.S., Vetta, A.: Sink Equilibria and Convergence. In: Proc. 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 152-164 (2005)
10. Goldberg, P.: Bounds for the Convergence Rate of Randomized Local Search in a Multiplayer Load-balancing Game. In: Proc. 23rd Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pp. 131-140 (2004)
11. Luby, M., Randall, D., Sinclair, A.J.: Markov Chain algorithms for planar lattice structures. SIAM Journal on Computing 31, 167-192 (2001)
12. Mirrokni, V.S., Vetta, A.: Convergence Issues in Competitive Games. In: Proc. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX-RANDOM), pp. 183-194 (2004)