{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000951126,0.0002918089,0.0003090031,0.0002638886,0.0003858155,0.0006333635,0.002238525,0.0001321402,0.00005969048],"category_scores_gemma":[0.0008539945,0.0002322007,0.000174488,0.0008032338,0.0003038426,0.002208771,0.0004945284,0.0003351383,0.000201473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001013565,"about_ca_system_score_gemma":0.00009749853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009535409,"about_ca_topic_score_gemma":0.000007842199,"domain_scores_codex":[0.9975267,0.00004463673,0.0008788415,0.0004245449,0.0006567389,0.0004685173],"domain_scores_gemma":[0.9976628,0.0001931849,0.0006676159,0.0004403323,0.0009246652,0.0001114395],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002694909,0.00005838148,0.0002242731,0.00003358324,0.00001059462,9.64569e-8,0.00160577,0.0008056458,0.06779741,0.7776586,0.00007316985,0.1517055],"study_design_scores_gemma":[0.000009964339,0.0001171153,0.00008736813,0.0001547542,0.000008633204,0.000006171011,0.0003359925,0.4050967,0.4777718,0.1161208,0.0001062388,0.0001845098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3791731,0.00001400697,0.6039934,0.001861158,0.0009806869,0.0005073589,0.000002958892,0.000226592,0.01324065],"genre_scores_gemma":[0.9846784,0.00001468127,0.01477651,0.0003677846,0.0001091025,0.00001712808,6.138098e-7,0.00001246274,0.00002336372],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6615378,"threshold_uncertainty_score":0.9468868,"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."}}