{"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002048387,0.00006212208,0.0001540583,0.0001026886,0.0001938771,0.00005421058,0.0006341874,0.00002859579,0.001585808],"category_scores_gemma":[0.00128886,0.00003269633,0.0001015146,0.001214447,0.0002802104,0.00003758143,0.00007744233,0.00006738259,0.0001571873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005241574,"about_ca_system_score_gemma":0.000003373407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003785872,"about_ca_topic_score_gemma":0.000004955931,"domain_scores_codex":[0.9989076,0.0001177662,0.00034446,0.0001919698,0.0002913809,0.0001468423],"domain_scores_gemma":[0.990994,0.008206381,0.0001561453,0.0004813698,0.0001246316,0.00003746443],"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.000005580853,0.00005088291,0.0001378667,4.766341e-7,0.000004937702,3.621278e-8,0.00005605265,0.001720171,0.00005187787,0.9587594,0.02481167,0.014401],"study_design_scores_gemma":[0.00009568079,0.0000409295,0.00231274,0.00000241788,0.000003630668,5.800438e-7,0.0001147601,0.5704139,0.0001651809,0.4256282,0.00118083,0.0000411184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3211591,0.00003497822,0.5663,0.003547775,0.0001017856,0.0003995441,0.00001352686,0.00003397026,0.1084092],"genre_scores_gemma":[0.9965212,8.51303e-7,0.001651689,0.0005182389,0.00004486354,0.000005646887,9.807759e-7,0.000003384799,0.001253086],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6753622,"threshold_uncertainty_score":0.9993269,"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."}}