{"id":"W7124146486","doi":"10.65109/brgu5963","title":"Efficient Nash equilibrium approximation through Monte Carlo counterfactual regret minimization","year":2012,"lang":"","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Counterfactual thinking; Nash equilibrium; Tree traversal; Regret; Outcome (game theory); Minification; Game tree; Sampling (signal processing); Perfect information","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.004792041,0.001162058,0.001869116,0.001245489,0.000692223,0.001578474,0.002211796,0.001469964,0.002750467],"category_scores_gemma":[0.02242995,0.0009334752,0.0008891498,0.00103119,0.001648011,0.002366122,0.001723788,0.002176335,0.0005354882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001974248,"about_ca_system_score_gemma":0.002317194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006164158,"about_ca_topic_score_gemma":0.007490536,"domain_scores_codex":[0.9968401,0.00183575,0.00009705866,0.000298834,0.0006708477,0.0002573959],"domain_scores_gemma":[0.9881808,0.009398948,0.000623226,0.0008887605,0.0006627119,0.000245502],"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.00009053644,0.00005057299,0.0006453717,0.00003968755,0.000037848,0.0000453528,0.00005092252,0.9423338,0.0003429943,0.04032935,0.0007470869,0.01528654],"study_design_scores_gemma":[0.000007037136,0.00000568777,0.00002411681,0.000003513182,0.000002334083,0.000005388659,0.000002716051,0.9904578,0.00009871627,0.009284487,0.0001061704,0.000002000964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01680033,0.0002031711,0.9795767,0.0002368287,0.00002452599,0.00005954615,0.00004161053,0.0003801699,0.002677208],"genre_scores_gemma":[0.5433239,0.0001968572,0.4527951,0.0002284505,0.00006294106,0.0003421514,0.0002072217,0.0001851676,0.002658225],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006164158,"threshold_uncertainty_score":0.025343,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05229019621391458,"score_gpt":0.295960230657099,"score_spread":0.2436700344431844,"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."}}