{"id":"W3099707780","doi":"10.1007/s11081-020-09578-9","title":"A decomposition method for a class of convex generalized Nash equilibrium problems","year":2020,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Nash equilibrium; Convexity; Mathematical optimization; Class (philosophy); Decomposition; Extension (predicate logic); Convergence (economics); Computer science; Constraint (computer-aided design); Set (abstract data type); Regular polygon; Decomposition method (queueing theory); Mathematics; Applied mathematics; Discrete mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.0001022481,0.00007726075,0.0001461939,0.00007154249,0.00002839574,0.00005828759,0.0001069543,0.00003712168,0.00001668334],"category_scores_gemma":[0.00004180337,0.00007908126,0.00004633384,0.0003299544,0.000004526591,0.0002419817,0.00004159271,0.00002721746,5.179367e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008477462,"about_ca_system_score_gemma":0.0000152502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002535756,"about_ca_topic_score_gemma":1.346506e-7,"domain_scores_codex":[0.9994367,0.00001694328,0.000198409,0.0001732999,0.0000878685,0.00008681589],"domain_scores_gemma":[0.9996178,0.000049418,0.00006971454,0.00007410705,0.0001144853,0.00007451962],"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.000003244318,0.000007893459,0.00001460782,0.00004879945,0.00002104698,7.664141e-8,0.0002105126,0.9742802,0.004453748,0.02066373,0.00005286572,0.0002432357],"study_design_scores_gemma":[0.0004449638,0.0000319885,0.0000262615,0.000008314614,0.00001458879,0.00000124219,0.000003885238,0.9976021,0.001047694,0.00004115183,0.0006892101,0.00008861603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001789384,0.00003892615,0.9973308,0.002101947,0.00004354645,0.0001399006,0.000004653317,0.00008804182,0.00007320696],"genre_scores_gemma":[0.0370388,0.00002338023,0.9624519,0.0003694955,0.00003054451,0.00002041962,0.00003650739,0.000008474061,0.00002042147],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03685986,"threshold_uncertainty_score":0.322484,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0155870147390554,"score_gpt":0.2493260114571431,"score_spread":0.2337389967180876,"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."}}