{"id":"W3094375143","doi":"10.1109/cog47356.2020.9231854","title":"Monte Carlo Tree Search Strategies in 2-Player Iterated Prisoner Dilemma Games","year":2020,"lang":"en","type":"article","venue":"2020 IEEE Conference on Games (CoG)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Monte Carlo tree search; Computer science; Iterated function; Prisoner's dilemma; Game tree; Tree (set theory); Dilemma; Game theory; Monte Carlo method; Fictitious play; Adversary; Variety (cybernetics); Mathematical optimization; Artificial intelligence; Mathematical economics; Sequential game; Mathematics; Computer security","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","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003443696,0.0005643386,0.0006595397,0.0002352767,0.0001236689,0.001292699,0.002261016,0.000249731,0.00034853],"category_scores_gemma":[0.0001955841,0.0005195034,0.0001648759,0.001328927,0.0002667255,0.001383262,0.0003500161,0.0009057678,0.001071217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008319693,"about_ca_system_score_gemma":0.0005800416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004601532,"about_ca_topic_score_gemma":0.000529426,"domain_scores_codex":[0.9956035,0.0003602995,0.0008229045,0.001391153,0.0008505299,0.0009716375],"domain_scores_gemma":[0.9977579,0.0002779675,0.0001859737,0.0009329687,0.0004076133,0.0004376387],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001071303,0.001316166,0.01117117,0.0004173816,0.0004795943,0.002930452,0.09731022,0.1161145,0.08684272,0.18503,0.03631236,0.4610041],"study_design_scores_gemma":[0.0005475371,0.0009538314,0.004638643,0.0002633988,0.00002456256,0.00001416279,0.003127144,0.952181,0.02937185,0.002213998,0.00549901,0.001164867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8940722,0.0003994049,0.06442752,0.02151647,0.001213106,0.001594832,0.00004717196,0.00100391,0.01572534],"genre_scores_gemma":[0.9949941,0.0001240947,0.002573204,0.001198181,0.0002494971,0.0001108217,0.000004244874,0.00004402646,0.0007018428],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8360665,"threshold_uncertainty_score":0.9997441,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.085846143607329,"score_gpt":0.3095868613929219,"score_spread":0.2237407177855929,"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."}}