{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034228,0.001082737,0.001522051,0.001075088,0.000579833,0.0008980916,0.002299767,0.001146684,0.003853632],"category_scores_gemma":[0.01452616,0.0005931674,0.0007548652,0.00060987,0.001134553,0.001737543,0.001716953,0.001434362,0.001073208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001005715,"about_ca_system_score_gemma":0.001761373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00413649,"about_ca_topic_score_gemma":0.005065994,"domain_scores_codex":[0.9982417,0.0007648891,0.0000959679,0.0002686314,0.0004730892,0.000155798],"domain_scores_gemma":[0.9940612,0.004186432,0.0004524744,0.0005830048,0.0005120289,0.0002048843],"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.0005346703,0.0002014501,0.002614446,0.0001768722,0.0001458257,0.0001278147,0.0002002125,0.7843134,0.00360161,0.03500405,0.002375637,0.170704],"study_design_scores_gemma":[0.0000273534,0.00003213565,0.00007829459,0.000005604864,0.000004749887,0.00001660584,0.000008158017,0.9935923,0.0005169353,0.005403005,0.0003100746,0.000004871337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01041379,0.00007853751,0.9872039,0.0000779313,0.00001781112,0.00009393159,0.00003082218,0.001174464,0.0009087797],"genre_scores_gemma":[0.274971,0.00007764023,0.7226542,0.0001723745,0.00003149044,0.0004751768,0.0002103439,0.0002403349,0.001167357],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00413649,"threshold_uncertainty_score":0.01810169,"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."}}