{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003995407,0.0002292872,0.000483417,0.0001344984,0.0003222558,0.0001990018,0.0017761,0.00009192723,0.000006437869],"category_scores_gemma":[0.0006242791,0.0001701994,0.0001632049,0.0003022665,0.0009254852,0.000175262,0.0002971425,0.0003263649,0.000009621539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001618866,"about_ca_system_score_gemma":0.0001096132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007568489,"about_ca_topic_score_gemma":0.000007368114,"domain_scores_codex":[0.9975907,0.0004291073,0.0008425465,0.0003663342,0.0003846214,0.0003867207],"domain_scores_gemma":[0.9908009,0.007104217,0.000802862,0.000883725,0.0003549298,0.00005343061],"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.00001968976,0.00004476697,0.00008636283,0.0001093227,0.00003503162,7.787042e-7,0.007250335,0.02819847,0.004473928,0.9557217,0.0001141829,0.00394545],"study_design_scores_gemma":[0.00009599848,0.000191367,0.000365648,0.0003683465,0.000009323182,0.0000101746,0.003311806,0.6517985,0.01056512,0.3330075,0.00007958615,0.0001966173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4288842,0.00003501751,0.568016,0.0001472625,0.00104097,0.0003410451,0.000006614858,0.0001045142,0.001424407],"genre_scores_gemma":[0.9878174,3.761699e-7,0.01183711,0.00008839512,0.0002044555,0.000003982299,0.000001831808,0.00001817617,0.00002826168],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6236001,"threshold_uncertainty_score":0.694053,"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."}}