{"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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006803945,0.0002446534,0.0004368263,0.0001154038,0.0002458024,0.001053807,0.002725027,0.0001430087,0.00001172928],"category_scores_gemma":[0.0004571963,0.0002284161,0.0001325829,0.0003032927,0.0001323806,0.0008858895,0.0007055778,0.0002240194,0.0001373545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009391558,"about_ca_system_score_gemma":0.00008139217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009646172,"about_ca_topic_score_gemma":0.00004186053,"domain_scores_codex":[0.9975876,0.0001718888,0.0005652921,0.0005341104,0.000446647,0.0006945063],"domain_scores_gemma":[0.9971878,0.0002218349,0.0003392046,0.002017665,0.00006764703,0.0001658411],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009036974,0.001237087,0.1604247,0.0005393552,0.0006487923,0.002033579,0.002384701,0.002686461,0.01135613,0.6749027,0.0349932,0.1087029],"study_design_scores_gemma":[0.0009743088,0.0000286035,0.1879016,0.0001529115,0.000009155267,0.00001647603,0.0000129402,0.8035768,0.00007005642,0.004709413,0.002262262,0.0002854734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2212478,0.0001408904,0.7601885,0.01071861,0.001641444,0.0007936294,0.00004065349,0.001236881,0.0039916],"genre_scores_gemma":[0.9952653,0.0000029092,0.004330604,0.000130719,0.000102985,0.00005800143,0.00002005398,0.00001554565,0.000073857],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8008903,"threshold_uncertainty_score":0.9999832,"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."}}