{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003922381,0.000168082,0.0001574901,0.0001026977,0.0003347314,0.000203831,0.0008587943,0.00009915227,0.00008083671],"category_scores_gemma":[0.00005889381,0.0001575502,0.00008862319,0.0006100414,0.0000348413,0.0002815445,0.00001688566,0.0003644863,0.0001652515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001160941,"about_ca_system_score_gemma":0.00005339087,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002359844,"about_ca_topic_score_gemma":0.00001145767,"domain_scores_codex":[0.9984339,0.0001209897,0.0002168875,0.0004229071,0.0004289733,0.0003763729],"domain_scores_gemma":[0.9984458,0.0002529146,0.00004983394,0.0009311091,0.0001332127,0.0001871258],"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.00000920177,0.0002129032,0.00001152095,0.000005299934,0.00002773014,0.000004110734,0.0001632631,0.5029678,0.00001425947,0.002303116,0.0008093032,0.4934714],"study_design_scores_gemma":[0.0005509963,0.0002287957,0.0004061665,0.00002655596,0.000005456411,0.000007094946,0.000009913941,0.9854301,0.000235101,0.0008714196,0.01202658,0.0002018628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00008728336,0.000008860441,0.9945712,0.002804307,0.0005987432,0.0001643195,0.00001097492,0.0004263178,0.001327961],"genre_scores_gemma":[0.7148296,0.0001072856,0.2805309,0.00314583,0.0002003931,0.00008115426,0.0000275965,0.00003850944,0.001038681],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7147424,"threshold_uncertainty_score":0.642471,"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."}}