{"id":"W2950706753","doi":"10.48550/arxiv.1303.4441","title":"Solving Imperfect Information Games Using Decomposition","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Perfect information; Computer science; Decomposition; Extensive-form game; Subgame perfect equilibrium; Imperfect; Sequential game; Nash equilibrium; Mathematical optimization; Subgame; Normal-form game; Construct (python library); Repeated game; Combinatorial game theory; Game theory; Mathematical economics; Best response; Mathematics; Epsilon-equilibrium","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"],"consensus_categories":[],"category_scores_codex":[0.000228916,0.0002859697,0.0002559771,0.0003843934,0.0002299217,0.000519897,0.00147135,0.0002833287,0.00006933864],"category_scores_gemma":[0.00005033664,0.0003378355,0.0001839806,0.0004196271,0.00009723168,0.003000837,0.001767205,0.0004585174,0.0004861464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003803234,"about_ca_system_score_gemma":0.0001820119,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007191507,"about_ca_topic_score_gemma":0.00001752921,"domain_scores_codex":[0.9985207,0.0001194211,0.0003097245,0.0005706652,0.0001144441,0.000365081],"domain_scores_gemma":[0.9981766,0.0001073966,0.0003802099,0.0009170992,0.0002892129,0.0001295281],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001213318,0.00004948323,0.00205851,0.0000968228,0.00007408433,0.00004370316,0.001518277,0.8524066,0.0006643257,0.132693,0.0003900266,0.009993094],"study_design_scores_gemma":[0.00005364919,0.00002553717,0.0003535602,0.0001093363,0.0000283251,0.000006949514,0.0001522268,0.954202,0.002460857,0.0421048,0.0001363561,0.0003664067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4306472,0.00002081823,0.5674343,0.00003110399,0.0005535815,0.0002000393,0.000002672418,0.0001980994,0.0009122487],"genre_scores_gemma":[0.9888108,0.00006569026,0.01083428,0.0001102898,0.00008017255,0.000001140603,0.00001291161,0.00001094553,0.00007381322],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5581636,"threshold_uncertainty_score":0.9999074,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07602123312568335,"score_gpt":0.2266096167108481,"score_spread":0.1505883835851648,"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."}}