{"id":"W4413337006","doi":"10.1002/rnc.70150","title":"Strategic Learning for Disturbance Rejection in Multi‐Agent Systems: Nash and Minmax in Graphical Games","year":2025,"lang":"en","type":"article","venue":"International Journal of Robust and Nonlinear Control","topic":"Adaptive Dynamic Programming Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada","keywords":"Minimax; Computer science; Nash equilibrium; Disturbance (geology); Mathematical optimization; Artificial intelligence; Mathematical economics; Mathematics; Biology","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":[],"consensus_categories":[],"category_scores_codex":[0.0006326415,0.00009913104,0.0002312164,0.0003794429,0.00003184103,0.0001621008,0.000274007,0.00005939263,2.052573e-7],"category_scores_gemma":[0.0001817666,0.00008687735,0.00005598214,0.0001339443,0.00004342292,0.0002934807,0.0000433698,0.0002536184,1.149172e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009227137,"about_ca_system_score_gemma":0.00007895896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000327958,"about_ca_topic_score_gemma":0.00009668289,"domain_scores_codex":[0.998997,0.00009514329,0.0004183038,0.000176193,0.0001763452,0.000137032],"domain_scores_gemma":[0.9991407,0.000275558,0.0002093622,0.00005571718,0.0002813526,0.00003726524],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003527363,0.001222618,0.4490847,0.0003156299,0.0010687,0.0006864034,0.001709825,0.1476196,0.002245349,0.1610683,0.00009064353,0.2313609],"study_design_scores_gemma":[0.005101471,0.0001390886,0.016852,0.0002365702,0.00001095109,0.00005336965,0.0001648575,0.9755402,0.000005552859,0.0007810874,0.001029269,0.00008555571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1437727,0.003020593,0.8506106,0.00168168,0.0006541355,0.0002263388,0.000003566884,0.00001022429,0.00002025401],"genre_scores_gemma":[0.987182,0.0001934641,0.01236121,0.00008267377,0.00008838163,0.0000139099,0.000001250088,0.000004025595,0.00007314917],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8434092,"threshold_uncertainty_score":0.3542756,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01802675923695948,"score_gpt":0.2772433489958614,"score_spread":0.2592165897589019,"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."}}