{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005184512,0.001214791,0.001952212,0.001288296,0.0007205606,0.001667753,0.002322075,0.001510953,0.002949198],"category_scores_gemma":[0.02252902,0.0009703855,0.0009377983,0.001104487,0.001679311,0.002456176,0.001804816,0.002207792,0.0005590285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00205257,"about_ca_system_score_gemma":0.002455029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006220234,"about_ca_topic_score_gemma":0.007586652,"domain_scores_codex":[0.9966015,0.001975684,0.0001053433,0.0003095276,0.0007311466,0.0002768561],"domain_scores_gemma":[0.9871572,0.01025704,0.0006627575,0.0009787484,0.0006884683,0.0002558967],"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.00009427992,0.00005162075,0.0006201557,0.00004095179,0.00004008073,0.00004509803,0.00005008873,0.9392142,0.0003426677,0.04307678,0.000795741,0.0156284],"study_design_scores_gemma":[0.000006547241,0.000005330281,0.00002222957,0.00000326735,0.000002245769,0.000005061825,0.000002546241,0.9913245,0.00009749617,0.008419811,0.0001089684,0.000001955819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01508063,0.0002008405,0.9813208,0.0002412011,0.00002468408,0.00005764409,0.00003941053,0.0003914518,0.002643273],"genre_scores_gemma":[0.5118716,0.0002126023,0.4838656,0.0002300132,0.00007209677,0.0003482592,0.0002099001,0.0002031645,0.002986635],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006220234,"threshold_uncertainty_score":0.02741867,"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."}}