{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002713407,0.001749528,0.001840383,0.001129529,0.0009220032,0.002480943,0.001421912,0.001203296,0.004554449],"category_scores_gemma":[0.008843525,0.0008758966,0.00234605,0.0009905915,0.002431208,0.003267963,0.003091868,0.00324113,0.0007021931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002394689,"about_ca_system_score_gemma":0.003493587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004231459,"about_ca_topic_score_gemma":0.003845856,"domain_scores_codex":[0.9970453,0.001294108,0.0001788779,0.0005220717,0.0005289763,0.0004306323],"domain_scores_gemma":[0.9949117,0.003784775,0.0002905095,0.000491649,0.0002571519,0.00026426],"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.0002226503,0.0001943062,0.0007441962,0.0003485035,0.0001408292,0.0001560304,0.0004315181,0.6203633,0.003455648,0.3113088,0.003868696,0.0587655],"study_design_scores_gemma":[0.00004978132,0.00004924045,0.0001016119,0.00003490399,0.00002540349,0.00004105817,0.00006761084,0.7409301,0.001269684,0.2554671,0.001944643,0.00001883576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01692856,0.00011647,0.9741141,0.0003249723,0.00003658457,0.0002152131,0.0001211194,0.000293431,0.007849487],"genre_scores_gemma":[0.3195216,0.0004194294,0.6722639,0.0002803245,0.00007651931,0.0007153409,0.0004467252,0.0001990454,0.006077186],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004554449,"threshold_uncertainty_score":0.01737475,"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."}}