{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003144465,0.001645299,0.00257533,0.000953858,0.001140454,0.002439363,0.002013968,0.002133184,0.00276002],"category_scores_gemma":[0.008410269,0.001350514,0.0009159423,0.001109645,0.002127265,0.001889585,0.003941655,0.001779496,0.0002668417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001725003,"about_ca_system_score_gemma":0.001671858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007760044,"about_ca_topic_score_gemma":0.007343484,"domain_scores_codex":[0.9987071,0.0006070299,0.00005776088,0.0002217973,0.0002043078,0.000202126],"domain_scores_gemma":[0.994432,0.004343291,0.0004218292,0.0001489895,0.0003977501,0.000256187],"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.00009128168,0.0000620782,0.0003318717,0.00007060904,0.00007349338,0.000120277,0.0001219529,0.9595552,0.0006814918,0.03349784,0.0004132168,0.00498078],"study_design_scores_gemma":[0.00001572294,0.00001650612,0.00003459854,0.000003631313,0.000007831117,0.000007785031,0.00001886792,0.9851679,0.0000855168,0.01454632,0.00009021734,0.00000518105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0663314,0.0001655033,0.9245878,0.0003307118,0.00003870037,0.00009741035,0.00005313168,0.00007387248,0.008321428],"genre_scores_gemma":[0.9385086,0.0001380986,0.05493481,0.00009374028,0.00002876634,0.0002197958,0.00006206026,0.00004606643,0.005968004],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007760044,"threshold_uncertainty_score":0.0166297,"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."}}