{"id":"W316638553","doi":"10.1007/s00037-008-0252-2","title":"On the Complexity of Succinct Zero-Sum Games","year":2005,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Game complexity; Mathematics; Multiplicative function; Zero-sum game; Zero (linguistics); Complement (music); Discrete mathematics; Combinatorics; PSPACE; Value (mathematics); Combinatorial game theory; Class (philosophy); P; Complexity class; Time complexity; Computational complexity theory; Repeated game; Game theory; Computer science; Algorithm; Mathematical economics; Average-case complexity","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.003456963,0.001786871,0.002167326,0.001260306,0.001649428,0.00596825,0.003728522,0.002591558,0.009539934],"category_scores_gemma":[0.02911139,0.001045872,0.002189285,0.001959818,0.003800129,0.01393161,0.004523263,0.00726642,0.0010387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005323772,"about_ca_system_score_gemma":0.003145332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005030595,"about_ca_topic_score_gemma":0.004368679,"domain_scores_codex":[0.9937938,0.001932643,0.0003378373,0.001178402,0.001646703,0.001110459],"domain_scores_gemma":[0.9600261,0.03452334,0.001406135,0.002197076,0.0009718349,0.0008754296],"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.001584628,0.0005052522,0.004248949,0.000890744,0.0002247995,0.0003567753,0.001117104,0.4611142,0.004512347,0.4696885,0.01131618,0.04444057],"study_design_scores_gemma":[0.0001212979,0.00005352707,0.0003952916,0.00004343659,0.00003871507,0.00008199382,0.0001084066,0.4652396,0.001167379,0.5312537,0.001468075,0.00002854837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4047859,0.002730627,0.5336621,0.01369565,0.0002809273,0.0006244275,0.004534873,0.001712163,0.03797339],"genre_scores_gemma":[0.8902498,0.00166299,0.0930165,0.00115082,0.0003888655,0.0006589658,0.003027024,0.0005065662,0.009338496],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009539934,"threshold_uncertainty_score":0.03862679,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08495536218311425,"score_gpt":0.2882672099705096,"score_spread":0.2033118477873953,"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."}}