{"id":"W2107671063","doi":"10.1109/ijcnn.1991.155354","title":"On the complexity of computing equilibria for nonsymmetric analog networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Vertex (graph theory); Simplex; Polynomial; Linear programming; Theoretical computer science; Computational complexity theory; Simplex algorithm; Time complexity; Algorithm; Mathematics; Mathematical optimization; Combinatorics","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.003478407,0.001021971,0.001559572,0.001469621,0.001901836,0.005181359,0.002341537,0.00190568,0.01218006],"category_scores_gemma":[0.02952532,0.0009314953,0.001757932,0.001830087,0.002569906,0.01013134,0.003365047,0.003159776,0.001006858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003047767,"about_ca_system_score_gemma":0.002035868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006639069,"about_ca_topic_score_gemma":0.008003805,"domain_scores_codex":[0.9967739,0.001198535,0.0002254105,0.0006834063,0.0006906653,0.0004280887],"domain_scores_gemma":[0.9494048,0.04472438,0.001882272,0.002340341,0.001130413,0.0005177504],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001149551,0.0002725669,0.00418068,0.0005790659,0.0001880386,0.000286709,0.00051803,0.6792631,0.003312655,0.2179353,0.00611556,0.08619873],"study_design_scores_gemma":[0.00007110165,0.00003620907,0.000352851,0.0000239916,0.00002985171,0.00005911394,0.00009977587,0.6976728,0.001449244,0.2994534,0.0007312875,0.00002040678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2460046,0.0008002919,0.7295813,0.003529969,0.0001153292,0.0003065477,0.0009388251,0.001370098,0.01735313],"genre_scores_gemma":[0.736494,0.000799293,0.2537367,0.0004740123,0.0001482647,0.0002978886,0.00149016,0.000407496,0.0061522],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01218006,"threshold_uncertainty_score":0.04074633,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.4002223552528442,"score_gpt":0.4009834040334108,"score_spread":0.0007610487805665977,"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."}}