{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007910354,0.0006127091,0.0006578392,0.0004704227,0.0006788187,0.000646809,0.001126576,0.0006942304,0.001605004],"category_scores_gemma":[0.001763716,0.00021778,0.0003237089,0.0003355823,0.0007959863,0.0008251065,0.000798811,0.0004975622,0.0003354827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004928969,"about_ca_system_score_gemma":0.0008493767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002289884,"about_ca_topic_score_gemma":0.002089067,"domain_scores_codex":[0.9994948,0.0001823618,0.00002385441,0.00008766168,0.0001639839,0.0000473644],"domain_scores_gemma":[0.9994142,0.0003277356,0.00006109726,0.00004474962,0.0001138644,0.00003826094],"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.0002058628,0.00007997251,0.0005067489,0.000132564,0.00008597072,0.0002217974,0.000197072,0.8306442,0.008441341,0.102801,0.001938664,0.05474482],"study_design_scores_gemma":[0.00002946888,0.00004227802,0.00003328284,0.000003687946,0.000008008789,0.00002446374,0.00001217283,0.9874181,0.0008149804,0.01082264,0.0007839439,0.00000707368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01495676,0.0001043506,0.9801283,0.0001090673,0.0000373283,0.0000585278,0.00001491337,0.0002707016,0.004320017],"genre_scores_gemma":[0.7601939,0.0001838123,0.2345233,0.0001236197,0.00004802252,0.0002430544,0.00004980977,0.00005011538,0.004584295],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002289884,"threshold_uncertainty_score":0.005369246,"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."}}