{"id":"W2604292427","doi":"10.1016/j.automatica.2017.09.016","title":"Distributed Nash equilibrium seeking in networked graphical games","year":2017,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nash equilibrium; Best response; Mathematical optimization; Graph; Computer science; Correlated equilibrium; Convergence (economics); Epsilon-equilibrium; Game theory; Adjacency matrix; Gossip; Distributed algorithm; Mathematical economics; Theoretical computer science; Equilibrium selection; Mathematics; Repeated game; Distributed computing; Economics","routes":{"ca_aff":true,"ca_fund":true,"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.0015635,0.0009042645,0.001343962,0.0006959046,0.0008551042,0.001725963,0.001531934,0.00167813,0.003701575],"category_scores_gemma":[0.007444919,0.0006045812,0.0006008046,0.0005443111,0.002344048,0.002041894,0.002571165,0.001226356,0.0003208086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001514401,"about_ca_system_score_gemma":0.001229671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004568707,"about_ca_topic_score_gemma":0.004182012,"domain_scores_codex":[0.9989094,0.0005778842,0.0000278211,0.0001689426,0.0001731624,0.0001427736],"domain_scores_gemma":[0.9966913,0.002413263,0.0003294249,0.0001019531,0.0002120173,0.0002519858],"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.0001941957,0.0001011219,0.0006396708,0.0001028935,0.00006058959,0.0001852316,0.0003481203,0.7442037,0.002033974,0.2407719,0.001203838,0.01015467],"study_design_scores_gemma":[0.00004720324,0.0000341715,0.00008056234,0.000006343617,0.00000899202,0.00001761654,0.00004477701,0.9020164,0.0002026489,0.09726418,0.000267861,0.000009225544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1729118,0.000222834,0.8024273,0.0009932035,0.00007208182,0.0001074848,0.00005424194,0.0001670688,0.02304397],"genre_scores_gemma":[0.971619,0.0001155701,0.01962572,0.00008121663,0.00002179692,0.0001075426,0.00002741994,0.00002965611,0.008371988],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004568707,"threshold_uncertainty_score":0.01238298,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01672577432875929,"score_gpt":0.2643119245474964,"score_spread":0.2475861502187371,"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."}}