{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T04:09:16Z","timestamp":1748923756077,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,7,25]],"date-time":"2004-07-25T00:00:00Z","timestamp":1090713600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,7,25]]},"DOI":"10.1145\/1011767.1011787","type":"proceedings-article","created":{"date-parts":[[2004,10,7]],"date-time":"2004-10-07T17:39:48Z","timestamp":1097170788000},"page":"131-140","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":35,"title":["Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game"],"prefix":"10.1145","author":[{"given":"Paul W.","family":"Goldberg","sequence":"first","affiliation":[{"name":"University of Warwick, UK"}]}],"member":"320","published-online":{"date-parts":[[2004,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195412"},{"volume-title":"The Natural Work-Stealing Algorithm is Stable. to appear in SICOMP, copyright SIAM. Preliminary version in FOCS'01","author":"Berenbrink P.","key":"e_1_3_2_1_2_1","unstructured":"P. Berenbrink , T. Friedetzsky and L.A. Goldberg . The Natural Work-Stealing Algorithm is Stable. to appear in SICOMP, copyright SIAM. Preliminary version in FOCS'01 . P. Berenbrink, T. Friedetzsky and L.A. Goldberg. The Natural Work-Stealing Algorithm is Stable. to appear in SICOMP, copyright SIAM. Preliminary version in FOCS'01."},{"key":"e_1_3_2_1_3_1","unstructured":"P. Berenbrink L.A. Goldberg P.W. Goldberg and R. Martin. Utilitarian Resource Assignment. manuscript.  P. Berenbrink L.A. Goldberg P.W. Goldberg and R. Martin. Utilitarian Resource Assignment. manuscript."},{"key":"e_1_3_2_1_4_1","first-page":"413","volume-title":"Procs. 13th Annual Symposium on Discrete Algorithms, SIAM","author":"Czumaj A.","year":"2002","unstructured":"A. Czumaj and B. V\u00f6cking . Tight Bounds for Worst-Case Equilibria . Procs. 13th Annual Symposium on Discrete Algorithms, SIAM , Philadelphia, PA ( 2002 ), pp. 413 -- 420 . A. Czumaj and B. V\u00f6cking. Tight Bounds for Worst-Case Equilibria. Procs. 13th Annual Symposium on Discrete Algorithms, SIAM, Philadelphia, PA (2002), pp. 413--420."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509952"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1759210.1759261"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1759210.1759262"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/646255.684270"},{"key":"e_1_3_2_1_10_1","unstructured":"M. Gairing T. L\u00fccking M. Mavronicolas B. Monien and P. Spirakis. The Structure and Complexity of Extreme Nash Equilibria. manuscript.  M. Gairing T. L\u00fccking M. Mavronicolas B. Monien and P. Spirakis. The Structure and Complexity of Extreme Nash Equilibria. manuscript."},{"first-page":"415","volume-title":"Giel and Ingo Wegener. Evolutionary Algorithms and the Maximum Matching Problem. Procs. of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003)","key":"e_1_3_2_1_11_1","unstructured":"Oliver Giel and Ingo Wegener. Evolutionary Algorithms and the Maximum Matching Problem. Procs. of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003) pp. 415 -- 426 . Oliver Giel and Ingo Wegener. Evolutionary Algorithms and the Maximum Matching Problem. Procs. of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003) pp. 415--426."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1764891.1764944"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380846"},{"key":"e_1_3_2_1_14_1","unstructured":"F. Neumann and I. Wegener. Randomized Local Search Evolutionary Algorithms and the Minimum Spanning Tree Problem manuscript.  F. Neumann and I. Wegener. Randomized Local Search Evolutionary Algorithms and the Minimum Spanning Tree Problem manuscript."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796571"},{"key":"e_1_3_2_1_16_1","unstructured":"T. Roughgarden. Many papers studying the cost of selfish routing in the flow-model are available at Tim Roughgarden's web page http:\/\/www.cs.cornell.edu\/timr\/ (which also has information and summaries).  T. Roughgarden. Many papers studying the cost of selfish routing in the flow-model are available at Tim Roughgarden's web page http:\/\/www.cs.cornell.edu\/timr\/ (which also has information and summaries)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796480"},{"key":"e_1_3_2_1_18_1","volume-title":"Theory of Randomized Search Heuristics MFCS '2003","author":"Wegener I.","year":"2003","unstructured":"I. Wegener . Towards a Theory of Randomized Search Heuristics MFCS '2003 , LNCS 2747, 125--141, 2003 . I. Wegener. Towards a Theory of Randomized Search Heuristics MFCS '2003, LNCS 2747, 125--141, 2003."},{"key":"e_1_3_2_1_19_1","first-page":"622","volume-title":"Procs. of GECCO","author":"Wegener I.","year":"2003","unstructured":"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 . 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."}],"event":{"name":"PODC04: Principles of Distributed Computing 2004","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"St. John's Newfoundland Canada","acronym":"PODC04"},"container-title":["Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1011767.1011787","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1011767.1011787","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T20:13:41Z","timestamp":1748895221000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1011767.1011787"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,7,25]]},"references-count":19,"alternative-id":["10.1145\/1011767.1011787","10.1145\/1011767"],"URL":"https:\/\/doi.org\/10.1145\/1011767.1011787","relation":{},"subject":[],"published":{"date-parts":[[2004,7,25]]},"assertion":[{"value":"2004-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}