{"id":"W2949161887","doi":"10.4108/eai.13-7-2018.158526","title":"Nash Equilibrium Seeking with Non-doubly Stochastic Communication Weight Matrix","year":2019,"lang":"en","type":"article","venue":"EAI Endorsed Transactions on Collaborative Computing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Nash equilibrium; Convergence (economics); Best response; Computer science; Gossip; Correlated equilibrium; Transitive reduction; Game theory; Mathematics; Mathematical optimization; Mathematical economics; Repeated game; Theoretical computer science; Discrete mathematics; Equilibrium selection; Graph; 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.001131415,0.0009075956,0.001217863,0.0004473054,0.0005316189,0.0008135143,0.001522096,0.001220109,0.001699038],"category_scores_gemma":[0.003206168,0.0004437735,0.0005921989,0.000488036,0.0009666106,0.001115502,0.001606334,0.0008954253,0.0003793918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006630809,"about_ca_system_score_gemma":0.001191438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003478558,"about_ca_topic_score_gemma":0.003117547,"domain_scores_codex":[0.9991897,0.0003270291,0.00002909791,0.0001583516,0.0001950621,0.0001008127],"domain_scores_gemma":[0.9986103,0.0008457524,0.0001572323,0.00009076732,0.000216079,0.00007987166],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000061417,0.00004872786,0.0002869032,0.00004890897,0.00004078103,0.00007409527,0.00005436183,0.9465289,0.001714361,0.03793417,0.0005488314,0.01265861],"study_design_scores_gemma":[0.000009534361,0.00001536359,0.00001621732,0.000001289408,0.000002849366,0.000005901198,0.000002433578,0.9953793,0.0001028279,0.004362321,0.00009877658,0.00000306373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01258546,0.00006045754,0.9852755,0.0001241905,0.00002380227,0.00003212373,0.00001422313,0.000079158,0.001805005],"genre_scores_gemma":[0.7940529,0.0001559986,0.1996479,0.0001323662,0.00005021103,0.0002314064,0.00006768705,0.00004895928,0.005612629],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003478558,"threshold_uncertainty_score":0.006916642,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006779131420443285,"score_gpt":0.2387392077905154,"score_spread":0.2319600763700721,"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."}}