{"id":"W2102509082","doi":"10.5555/2343776.2343816","title":"Efficient Nash equilibrium approximation through Monte Carlo counterfactual regret minimization","year":2012,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Tree traversal; Nash equilibrium; Counterfactual thinking; Computer science; Mathematical optimization; Regret; Game tree; Sampling (signal processing); Minification; Perfect information; Algorithm; Game theory; Mathematics; Mathematical economics; Repeated game; 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.0003233842,0.0001724003,0.0001526816,0.0000654231,0.00009577925,0.0001790604,0.0006069516,0.00009157902,0.00009173984],"category_scores_gemma":[0.0001109907,0.000149107,0.00007476189,0.0003491643,0.00007818138,0.001057067,0.0002520237,0.00009973357,0.0004199177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009761797,"about_ca_system_score_gemma":0.0000398037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008445095,"about_ca_topic_score_gemma":0.000006889108,"domain_scores_codex":[0.998318,0.000074492,0.0003605448,0.0003248871,0.0004515412,0.0004705218],"domain_scores_gemma":[0.9989395,0.0001154178,0.0001306349,0.0005656357,0.000150161,0.00009867251],"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.00007572059,0.001333967,0.008777087,0.0001090861,0.0001273807,0.000008321887,0.1060569,0.3668078,0.009081645,0.4116248,0.03107552,0.06492179],"study_design_scores_gemma":[0.00006012552,0.00004464179,0.0003278796,0.0000142191,0.000006769218,0.000009773145,0.0004657674,0.9512326,0.04408868,0.0005828824,0.002932898,0.0002337567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2170444,0.0001640649,0.7726243,0.0005066426,0.0009928196,0.0002308871,0.000001776694,0.0003072409,0.008127883],"genre_scores_gemma":[0.9473203,0.000003647157,0.0514082,0.0003358578,0.0001777079,0.00001756065,0.000002398154,0.00001281394,0.0007215507],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7302759,"threshold_uncertainty_score":0.6080409,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04266426858457787,"score_gpt":0.2869270409759873,"score_spread":0.2442627723914094,"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."}}