{"id":"W2622743094","doi":"10.1145/2629671","title":"Distributed Selfish Load Balancing on Networks","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Division of Computer and Network Systems; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Nash equilibrium; Convergence (economics); Computer science; Logarithm; Vertex (graph theory); Potential game; Load balancing (electrical power); Mathematical optimization; Computation; Graph; Best response; Distributed algorithm; Polynomial; Coordination game; Mathematics; Distributed computing; Theoretical computer science; Mathematical economics; Algorithm","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00108496,0.0005911044,0.0006540558,0.00045659,0.0007227454,0.001290529,0.001256138,0.0009117645,0.001523994],"category_scores_gemma":[0.004691266,0.000288801,0.0003378073,0.000703492,0.001478969,0.002632047,0.001250987,0.0007165294,0.0002759353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009828578,"about_ca_system_score_gemma":0.0004522298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001671868,"about_ca_topic_score_gemma":0.001113093,"domain_scores_codex":[0.9992411,0.000284159,0.00002755094,0.000150238,0.0001673985,0.0001296282],"domain_scores_gemma":[0.9977715,0.001316041,0.0003735829,0.0002418807,0.0001871912,0.0001097513],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001145864,0.00005133209,0.0005205557,0.00006442934,0.00003327468,0.0001080896,0.0001398349,0.916131,0.003474353,0.06429674,0.0005385129,0.01452719],"study_design_scores_gemma":[0.00001657771,0.00003094936,0.00006260163,0.000003414497,0.000004674601,0.00001784269,0.00001934022,0.9728749,0.000518567,0.02565985,0.0007870637,0.000004111888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1724405,0.0006238917,0.8168623,0.0006695102,0.00009388693,0.00008868248,0.00004059994,0.0002594148,0.008921185],"genre_scores_gemma":[0.9646684,0.0003876606,0.03059993,0.00007266956,0.00006993637,0.00007704454,0.00002975455,0.0000348453,0.004059732],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001671868,"threshold_uncertainty_score":0.0071311,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01368730281871358,"score_gpt":0.2435060925670218,"score_spread":0.2298187897483082,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}