{"id":"W2519129141","doi":"10.1016/j.automatica.2017.07.064","title":"Distributed Nash equilibrium seeking for aggregative games with coupled constraints","year":2017,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":322,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"National Key Research and Development Program of China; Natural Science Foundation of Beijing Municipality; National Natural Science Foundation of China","keywords":"Nash equilibrium; Convergence (economics); Lyapunov function; Mathematical optimization; Distributed algorithm; Computer science; Information exchange; Simple (philosophy); Variational inequality; Multi-agent system; Best response; Mathematics; Topology (electrical circuits); Distributed computing; Nonlinear system; Economics","routes":{"ca_aff":true,"ca_fund":false,"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.00042936,0.0002863584,0.0004719069,0.00005794077,0.0004817955,0.001146932,0.001888259,0.00009333388,0.00001683433],"category_scores_gemma":[0.0006113849,0.0002343865,0.0001154503,0.0001183405,0.0003928491,0.0008958738,0.0002899473,0.0001110827,0.00006579498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009198466,"about_ca_system_score_gemma":0.0001667599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002889129,"about_ca_topic_score_gemma":0.0000130804,"domain_scores_codex":[0.9979585,0.00005234135,0.0004135849,0.0005518597,0.0004144628,0.0006092201],"domain_scores_gemma":[0.9968771,0.0004257465,0.000662547,0.001565304,0.0002810505,0.000188195],"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.0004926762,0.001715022,0.01748549,0.001918254,0.004616738,0.001007046,0.009196701,0.001256908,0.05224938,0.7050779,0.01998566,0.1849982],"study_design_scores_gemma":[0.003013412,0.0001761625,0.01395745,0.0003387781,0.00005007966,0.00004617372,0.00009584277,0.9774033,0.0009952702,0.002525114,0.0009723579,0.0004260838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03057719,0.000029284,0.9634503,0.002182632,0.0003923357,0.001151544,0.0002080109,0.0006128375,0.001395834],"genre_scores_gemma":[0.9752682,6.490999e-7,0.02410019,0.00008782634,0.00006915559,0.0002088679,0.00005238232,0.00002182937,0.0001908634],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9761463,"threshold_uncertainty_score":0.99989,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02008389679764252,"score_gpt":0.2691156533546784,"score_spread":0.2490317565570359,"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."}}