{"id":"W2151123669","doi":"10.5555/1838206.1838229","title":"Using counterfactual regret minimization to create competitive multiplayer poker agents","year":2010,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Perfect information; Computer science; Regret; Counterfactual thinking; Nash equilibrium; Extensive-form game; Mathematical economics; Strategy; Best response; Bayesian game; Complete information; Repeated game; Game theory; Mathematics; 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":[],"consensus_categories":[],"category_scores_codex":[0.0001546519,0.0001457447,0.0001300672,0.0001131102,0.0001317244,0.0002237454,0.0006251646,0.0000784629,0.000532298],"category_scores_gemma":[0.0001555053,0.0001296715,0.00004951106,0.0002614686,0.00006144551,0.0005346107,0.0002620056,0.0001475589,0.0006573902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003673286,"about_ca_system_score_gemma":0.00004758121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002075506,"about_ca_topic_score_gemma":0.0002645783,"domain_scores_codex":[0.9987664,0.00003663331,0.0002429905,0.0003936512,0.0002784106,0.0002819315],"domain_scores_gemma":[0.9990091,0.0001105553,0.00006522913,0.0004530442,0.0002190815,0.0001429593],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001703526,0.0007852959,0.04273453,0.00002913692,0.000204758,0.0001500776,0.04185547,0.03894631,0.2793049,0.4893647,0.01720712,0.08924726],"study_design_scores_gemma":[0.0001021463,0.00006805787,0.00298015,0.00002403266,0.000007426443,0.0000190792,0.0003839339,0.8059585,0.1769574,0.000657368,0.01247917,0.0003627699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3591504,0.000001767143,0.6318922,0.0003799899,0.0008440778,0.0001776334,0.000003300507,0.0001260769,0.007424552],"genre_scores_gemma":[0.8227111,8.243334e-7,0.1753742,0.0009633487,0.0000811021,0.000004575402,0.000001587105,0.00001025938,0.0008530537],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7670122,"threshold_uncertainty_score":0.844964,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0745210933639978,"score_gpt":0.3409293452544012,"score_spread":0.2664082518904033,"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."}}