{"id":"W2022745069","doi":"10.1109/cdc.2014.7039537","title":"Nash equilibrium seeking by a gossip-based algorithm","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Nash equilibrium; Gossip; Computer science; Best response; Asynchronous communication; Convergence (economics); Distributed algorithm; Algorithm; Correlated equilibrium; Game theory; Mathematical optimization; Epsilon-equilibrium; Graph; Set (abstract data type); Potential game; Theoretical computer science; Equilibrium selection; Mathematics; Repeated game; Distributed computing; Mathematical economics; Computer network","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.0005653133,0.0002081486,0.0002531577,0.00007604273,0.00008432575,0.0004460869,0.001275033,0.00008789583,0.00003595623],"category_scores_gemma":[0.00005724273,0.0001862774,0.0001068901,0.0003465556,0.00003390508,0.0004259121,0.0001895546,0.0001140293,0.0004157808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000641969,"about_ca_system_score_gemma":0.00005537463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009240983,"about_ca_topic_score_gemma":0.000003442755,"domain_scores_codex":[0.997999,0.0001626622,0.0003249951,0.0005463945,0.0004519776,0.0005149575],"domain_scores_gemma":[0.9985337,0.0001764579,0.0001218468,0.0008775967,0.00009306612,0.0001973184],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006860148,0.0002714158,0.0005697182,0.00004598634,0.00006500079,0.000020227,0.0001659263,0.000254569,0.04777929,0.02983042,0.06303599,0.8579546],"study_design_scores_gemma":[0.0008992912,0.00005352641,0.00009402476,0.00001950974,0.000004350159,0.000004475959,0.00000614945,0.9143156,0.002896531,0.0001780488,0.08128657,0.0002419597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005004191,0.0001135291,0.9855685,0.001106129,0.0006214128,0.0002038921,0.00001426907,0.0007112285,0.01116066],"genre_scores_gemma":[0.9071191,6.716272e-7,0.08921345,0.001672244,0.0001947248,0.0000476199,0.00002974842,0.00002378131,0.001698672],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.914061,"threshold_uncertainty_score":0.7596174,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007021373110070756,"score_gpt":0.2120941586840017,"score_spread":0.2050727855739309,"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."}}