{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006914148,0.0003090834,0.0003921013,0.0001950434,0.0005661559,0.0001526461,0.002072928,0.00006675757,0.0003154875],"category_scores_gemma":[0.0001376297,0.000242069,0.0002689518,0.0007617197,0.001417446,0.0003599219,0.0005908431,0.0003884404,0.0001827073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008478186,"about_ca_system_score_gemma":0.0001299704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007592309,"about_ca_topic_score_gemma":0.00004281501,"domain_scores_codex":[0.9971755,0.0003066295,0.0006022408,0.000578527,0.0009155673,0.0004215225],"domain_scores_gemma":[0.9973446,0.0009502349,0.0002950032,0.0009242514,0.0003457952,0.0001401212],"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.00001882774,0.0002714585,0.0001291545,0.00001314712,0.0000391812,0.00000225288,0.0002476429,0.01415908,0.00002065187,0.9723073,0.004441397,0.008349938],"study_design_scores_gemma":[0.0003100538,0.00009450181,0.03296119,0.00002312866,0.000004690929,0.00001648953,0.000009467255,0.315879,0.0002229432,0.6486314,0.001652692,0.000194404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1347377,0.000127078,0.8368512,0.0183749,0.000429127,0.0004431789,0.00008303401,0.0003196135,0.00863414],"genre_scores_gemma":[0.8724818,0.000002257693,0.1254413,0.001830992,0.0001176041,0.00001428388,0.00002862525,0.00001258027,0.00007048486],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7377441,"threshold_uncertainty_score":0.9871288,"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."}}