{"id":"W2114793692","doi":"10.1609/aaai.v28i1.8810","title":"Solving Imperfect Information Games Using Decomposition","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; Alberta Innovates - Technology Futures; Compute Canada","keywords":"Perfect information; Computer science; Decomposition; Extensive-form game; Imperfect; Sequential game; Subgame perfect equilibrium; Mathematical optimization; Nash equilibrium; Normal-form game; Construct (python library); Combinatorial game theory; Subgame; Game theory; Best response; Mathematical economics; Mathematics; Epsilon-equilibrium","routes":{"ca_aff":true,"ca_fund":true,"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.002808391,0.001774588,0.001874145,0.001131626,0.0009243403,0.002456419,0.001468107,0.001205802,0.004678993],"category_scores_gemma":[0.009018881,0.0008958012,0.002327934,0.0009798416,0.002391928,0.003287496,0.003126654,0.003163195,0.0006968786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00242999,"about_ca_system_score_gemma":0.003684436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004505374,"about_ca_topic_score_gemma":0.004004858,"domain_scores_codex":[0.9969159,0.001345632,0.0001833395,0.0005353591,0.0005526241,0.000467075],"domain_scores_gemma":[0.9945446,0.004069821,0.0003110117,0.0005133069,0.0002786347,0.000282701],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002064002,0.0001820215,0.0006845596,0.0003110037,0.0001269915,0.000152503,0.0003980477,0.6641023,0.003235012,0.2713245,0.003296891,0.05597986],"study_design_scores_gemma":[0.00004862609,0.0000516753,0.00009544243,0.00003396251,0.00002510104,0.0000407622,0.00006563793,0.7832403,0.001235259,0.2132825,0.001861686,0.00001901955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01629989,0.0001068629,0.9752703,0.0002842603,0.00003446273,0.0002090457,0.0001025519,0.0002926183,0.00740002],"genre_scores_gemma":[0.3226332,0.0003963872,0.6691357,0.0002731482,0.00007004761,0.0007396023,0.0004119641,0.0001997293,0.006140179],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004678993,"threshold_uncertainty_score":0.01763093,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05366474124327942,"score_gpt":0.3096907656912596,"score_spread":0.2560260244479802,"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."}}