{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000520353,0.0004596447,0.0005514233,0.0003693656,0.0005277465,0.000546796,0.001335322,0.0001294742,0.00005293045],"category_scores_gemma":[0.00002275209,0.0004327907,0.0001208726,0.002378611,0.00008633536,0.0009836368,0.00005269316,0.0005753825,0.0003545746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003175795,"about_ca_system_score_gemma":0.0003650466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003327942,"about_ca_topic_score_gemma":0.00003543928,"domain_scores_codex":[0.9967955,0.0004210217,0.0006161666,0.0008468594,0.0006854189,0.0006350604],"domain_scores_gemma":[0.9964866,0.0007597638,0.0004581882,0.00140709,0.0007035379,0.0001848332],"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.0003070818,0.000583648,0.0003235225,0.000111342,0.0005770412,0.00003519962,0.005274993,0.9566305,0.01765691,0.00788449,0.0003975467,0.01021769],"study_design_scores_gemma":[0.004853725,0.000396893,0.000487826,0.0004865772,0.00005262644,0.00003441317,0.0007319408,0.9878062,0.003187743,0.00007932926,0.001182269,0.0007004705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02524209,0.0001266122,0.9686642,0.0008587473,0.0008720671,0.001502092,0.00004904724,0.000514614,0.002170579],"genre_scores_gemma":[0.9741253,0.000002736798,0.02483108,0.0001172519,0.0000669536,0.0000703757,0.00002606368,0.00004769146,0.0007125291],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9488832,"threshold_uncertainty_score":0.9998124,"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."}}