{"id":"W2168635355","doi":"10.1007/s00224-010-9254-y","title":"On the Complexity of Computing Winning Strategies for Finite Poset Games","year":2010,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Partially ordered set; Infimum and supremum; Combinatorial game theory; PSPACE; Argument (complex analysis); Mathematics; Combinatorics; Game theory; Simple (philosophy); Theoretical computer science; Computer science; Discrete mathematics; Computational complexity theory; Mathematical economics; Sequential game; Algorithm; Epistemology","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.006983059,0.002069645,0.004196083,0.003626388,0.003924009,0.01738491,0.0057774,0.004627633,0.01756575],"category_scores_gemma":[0.07100796,0.002281482,0.005232539,0.005061761,0.007896888,0.03678782,0.009071345,0.009839365,0.001452027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007131466,"about_ca_system_score_gemma":0.005694937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007706684,"about_ca_topic_score_gemma":0.009402787,"domain_scores_codex":[0.9869469,0.004195576,0.001160444,0.002240107,0.003582067,0.001874864],"domain_scores_gemma":[0.8783607,0.1086818,0.002803382,0.00526338,0.002529213,0.00236157],"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.001443399,0.0006289858,0.005645386,0.0007725141,0.000330577,0.0003162662,0.001836339,0.1130409,0.002067834,0.8176292,0.00873681,0.04755175],"study_design_scores_gemma":[0.00009260918,0.00004938935,0.0004140315,0.00003452368,0.00006739113,0.00007291696,0.0001809638,0.1156038,0.000518312,0.8820969,0.0008292726,0.00003996503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3831392,0.002378809,0.5457851,0.01184543,0.0003923346,0.0006158431,0.002236584,0.00147107,0.05213572],"genre_scores_gemma":[0.8772387,0.001364098,0.1061981,0.0009493255,0.0005730742,0.0005254118,0.002825787,0.0005785375,0.009746979],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01756575,"threshold_uncertainty_score":0.05876333,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08009168828994542,"score_gpt":0.3117809293778928,"score_spread":0.2316892410879473,"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."}}