{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001095378,0.0006750023,0.000561337,0.0001950491,0.0003738503,0.0008117477,0.001509309,0.00041406,0.0008034725],"category_scores_gemma":[0.0003983075,0.0006471507,0.0003095615,0.001121461,0.0004670679,0.00270629,0.0009092998,0.000410897,0.001804587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004240912,"about_ca_system_score_gemma":0.0002351272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003185875,"about_ca_topic_score_gemma":0.00002047783,"domain_scores_codex":[0.9940563,0.0003750985,0.001436859,0.001072958,0.001426476,0.001632255],"domain_scores_gemma":[0.996489,0.0003538638,0.00063142,0.001515102,0.0006236925,0.0003868792],"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.0002217024,0.002718821,0.004793817,0.0003105845,0.0002938923,0.00001351052,0.1899173,0.5881649,0.003337053,0.09708615,0.01873069,0.09441153],"study_design_scores_gemma":[0.0001588466,0.0001843672,0.0003071335,0.0001047121,0.00005789366,0.0000278203,0.001899154,0.9520798,0.04005148,0.0003843077,0.00401259,0.0007318485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2369179,0.001573948,0.742457,0.001124808,0.005622158,0.0008940649,0.00001485403,0.0003356181,0.01105954],"genre_scores_gemma":[0.9636648,0.00004935596,0.03193726,0.0006252158,0.0008964377,0.00004051885,0.00000736519,0.00005647279,0.002722601],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7267468,"threshold_uncertainty_score":0.999598,"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."}}