{"id":"W2396453985","doi":"","title":"MCRNR: fast computing of restricted Nash responses by means of sampling","year":2010,"lang":"en","type":"article","venue":"","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Best response; Nash equilibrium; Game tree; Tree traversal; Regret; Perfect information; Monte Carlo tree search; Mathematical optimization; Tree (set theory); Sampling (signal processing); Counterfactual thinking; Estimator; Minimax; Algorithm; Game theory; Monte Carlo method; Machine learning; Mathematics; Repeated game; Mathematical economics","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.0003939171,0.0001085939,0.0002047635,0.0001390961,0.00007168562,0.00004209536,0.001022267,0.00007923419,0.00004369249],"category_scores_gemma":[0.0006199864,0.00009834258,0.00006374547,0.0005370218,0.0001736947,0.0002023935,0.0003015906,0.0001963235,0.00001419627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008950892,"about_ca_system_score_gemma":0.00007635858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002994082,"about_ca_topic_score_gemma":0.00008588856,"domain_scores_codex":[0.9986137,0.00006592627,0.0005097463,0.0002731633,0.0003076763,0.0002297642],"domain_scores_gemma":[0.9980311,0.0008499638,0.0002246346,0.0005784529,0.0002509661,0.00006486423],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002168222,0.0001111851,0.00584511,0.00001675001,0.00001647775,0.000001784959,0.001758333,0.0003458263,0.8475246,0.06107346,0.001056624,0.08222818],"study_design_scores_gemma":[0.00006602367,0.0001126662,0.00326946,0.0000358776,0.000004761218,0.000006898871,0.0003075451,0.09705883,0.8939137,0.003602536,0.00143361,0.0001880638],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.455709,0.00001495472,0.5421121,0.00015941,0.0002852717,0.00006303099,0.000003817664,0.00008147967,0.001570964],"genre_scores_gemma":[0.8387659,0.000002632319,0.1608983,0.00004689656,0.00002766047,7.341729e-7,7.916174e-7,0.000006333877,0.0002507454],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.383057,"threshold_uncertainty_score":0.4010294,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04221663454677622,"score_gpt":0.3175659271330701,"score_spread":0.2753492925862939,"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."}}