{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001539442,0.00135274,0.001151674,0.0009594973,0.0005405724,0.001157569,0.001136533,0.001151708,0.004660639],"category_scores_gemma":[0.003044844,0.0005771349,0.001316348,0.0008972141,0.0008970517,0.001363399,0.001986339,0.00258084,0.0009776773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007653127,"about_ca_system_score_gemma":0.001253754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002118581,"about_ca_topic_score_gemma":0.002745348,"domain_scores_codex":[0.9994778,0.0002554191,0.00002054937,0.00007207925,0.0001248879,0.00004935727],"domain_scores_gemma":[0.9993073,0.0003588233,0.00004244808,0.00005061494,0.0001678974,0.00007299981],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001094835,0.0001602478,0.0004256449,0.0003043726,0.000124792,0.0001427413,0.0001648895,0.2933782,0.007410269,0.5716353,0.009958633,0.1161854],"study_design_scores_gemma":[0.00001500451,0.00002498236,0.00006486539,0.00002369612,0.00001487376,0.00003434092,0.00001901221,0.9158112,0.0003198971,0.08070008,0.002962772,0.000009221839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001948585,0.0001600448,0.9950655,0.00009114719,0.00005229203,0.00002586889,0.00003274903,0.00002964703,0.002594182],"genre_scores_gemma":[0.1165183,0.0009005226,0.8692087,0.0001908347,0.0001785733,0.0004018369,0.0002607341,0.0002171169,0.01212338],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004660639,"threshold_uncertainty_score":0.01559138,"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."}}