{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002791074,0.0005779226,0.0008859328,0.0008245222,0.0005364126,0.001164098,0.0009770739,0.001302431,0.001438431],"category_scores_gemma":[0.01009263,0.0003299731,0.0005023171,0.0006511605,0.0009971458,0.001388857,0.0007049278,0.0005925724,0.0001831979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009972488,"about_ca_system_score_gemma":0.001125852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004118555,"about_ca_topic_score_gemma":0.003255931,"domain_scores_codex":[0.9977914,0.001583054,0.00006270752,0.0001180989,0.0003010245,0.0001436696],"domain_scores_gemma":[0.9930247,0.005959861,0.000380174,0.0001446541,0.0002931326,0.0001974101],"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.0001470024,0.00006620436,0.001229852,0.00004864134,0.00004426299,0.00005616291,0.00008886182,0.962873,0.0003769016,0.02667251,0.0002142576,0.008182311],"study_design_scores_gemma":[0.00001642371,0.0000661805,0.0001091731,0.000006374189,0.000005663614,0.0000170602,0.00001225684,0.9929254,0.0001070653,0.006521778,0.000206836,0.000005786958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4311344,0.001341501,0.551569,0.0003517367,0.00007795568,0.0002570881,0.00008832407,0.0002615883,0.0149185],"genre_scores_gemma":[0.9424213,0.0002619915,0.0557393,0.00007076492,0.00001212005,0.0001666465,0.00005209529,0.00002759771,0.001248164],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004118555,"threshold_uncertainty_score":0.01476079,"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."}}