{"id":"W2889616780","doi":"10.1609/aaai.v33i01.33011861","title":"Solving Large Extensive-Form Games with Strategy Constraints","year":2019,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Regret; Computer science; Set (abstract data type); Nash equilibrium; Mathematical optimization; Perfect information; Counterfactual thinking; Consistency (knowledge bases); Complete information; Mathematical economics; Mathematics; Artificial intelligence; Machine learning","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":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001135284,0.0009692255,0.001099441,0.0003921857,0.0003655034,0.001275949,0.006948959,0.0005656976,0.0002727753],"category_scores_gemma":[0.0006871657,0.0007044164,0.0004149257,0.0008358329,0.001368325,0.0008238161,0.003363529,0.001989373,0.0004165022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001878778,"about_ca_system_score_gemma":0.001031921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001063042,"about_ca_topic_score_gemma":0.00006371525,"domain_scores_codex":[0.9938288,0.00005538826,0.001517818,0.001869483,0.001518642,0.00120986],"domain_scores_gemma":[0.9932286,0.000313691,0.0018072,0.001474145,0.002935441,0.0002408813],"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.0001157552,0.0003160033,0.0005154436,0.000292504,0.0001151886,0.00000675384,0.00342129,0.001920116,0.004533004,0.8970601,0.0003483351,0.09135549],"study_design_scores_gemma":[0.00005172355,0.0006025835,0.0002928062,0.002725563,0.00007548551,0.00003314531,0.004039483,0.2101768,0.3885215,0.3920429,0.0001689897,0.001269047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3414414,0.0003971014,0.5257224,0.009145908,0.005967505,0.006392484,0.0002000778,0.001162305,0.1095708],"genre_scores_gemma":[0.9926829,0.0001355905,0.005791498,0.0004004874,0.0001837502,0.00009605267,0.000003385112,0.00006356956,0.0006427302],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6512416,"threshold_uncertainty_score":0.9997608,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07993644806912124,"score_gpt":0.3080277459254752,"score_spread":0.228091297856354,"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."}}