Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 23, Issue , 2004, Pages 131-140

  Goldberg, Paul W ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

Agent based computing; Nash equilibrium

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; DISTRIBUTED COMPUTER SYSTEMS; INTERNET; NETWORK PROTOCOLS; OPTIMIZATION; SEARCH ENGINES; USER INTERFACES;

DISTRIBUTED NETWORK; GAME-THEORETIC TERMS; NASH EQUILIBRIUM; RANDOMIZED LOCAL SEARCH;

GAME THEORY;

EID: 10444220135     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1011767.1011787     Document Type: Conference Paper

References (19)

1. Y. Azar, A. Broder, A. Karlin and E. Upfal. Balanced Allocations. Procs. of the 26th ACM STOC, pp. 593-602, (1994)
2. P. Berenbrink, T. Priedetzsky and L.A. Goldberg. The Natural Work-Stealing Algorithm is Stable, to appear in SICOMP, copyright SIAM. Preliminary version in FOGS'01.
3. P. Berenbrink, L.A. Goldberg, P.W. Goldberg and R. Martin. Utilitarian Resource Assignment. manuscript.
4. A. Czumaj and B. Vöcking. Tight Bounds for Worst-Case Equilibria. Procs. 13th Annual Symposium on Discrete Algorithms, SIAM, Philadelphia, PA (2002), pp. 413-420.
5. A. Czumaj, P. Krysta, and B. Völcking. Selfish Traffic Allocation for Server Farms. Procs. S4th Annual Symposium on Theory of Computing (STOC), Montreal, Canada (2002), pp. 287-296.
6. S. Droste, T. Jansen and I. Wegener. On the analysis of the (1+1) Evolutionary Algorithm. Theoretical Computer Science 276, pp. 51-81, 2002.
7. E. Even-Dar, A. Kesselman and Y. Mansour. Convergence Time to Nash Equilibria. Procs. of 30th International Colloquium on Automata, Languages, and Programming (ICALP), 2003.
8. R. Feldmann, M. Gairing, T. Lücking, B. Monien and M. Rode. Nashification and the Coordination Ratio for a Selfish Routing Game. Procs. of 30th International Colloquium on Automata, Languages, and Programming (ICALP), 2003.
9. D. Fotakis, S. Kontogiannis, E. Koutsoupias, M. Mavronicolas and P. Spirakis. The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. Procs. of 29th International Colloquium on Automata, Languages, and Programming (ICALP), Malaga, Spain (2002), pp. 123-134.
10. M. Gairing, T. Lücking, M. Mavronicolas, B. Monien and P. Spirakis. The Structure and Complexity of Extreme Nash Equilibria, manuscript
11. Oliver Giel and Ingo Wegener. Evolutionary Algorithms and the Maximum Matching Problem. Procs. of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STAGS 2003) pp. 415-426.
12. E. Koutsoupias and C.H. Papadimitriou. Worst-Case Equilibria. Procs. 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS), Trier, Germany (1999), pp. 404-413.
13. M. Mavronicolas, and P. Spirakis. The Price of Selfish Routing. Proc. 33rd Annual Symposium on Theory of Computing (STOC), Crete, Greece (2001), pp. 510-519.
14. F. Neumann and I. Wegener, Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem manuscript
15. T. Roughgarden and É. Tardos. How Bad is Selfish Routing? Proc. 41st Annual Symposium on Foundations of Computer Science (FOCS), Redondo Beach, CA (2000), pp. 93-102.
16. T. Roughgarden. Many papers studying the cost of selfish routing in the flow-model are available at Tim Roughgarden's web page http://ww.cs.cornell.edu/timr/ (which also has information and summaries).
17. B. Vöcking. How Asymmetry Helps Load Balancing. Procs. 40th IEEE-FOGS (New York, 1999) pp. 131-140.
18. I. Wegener. Towards a Theory of Randomized Search Heuristics MFCS '2003, LNCS 2747, 125-141, 2003.
19. I. Wegener and C. Witt. On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics. Procs. of GECCO 2003, LNCS 2723, pp. 622-633