{"id":"W2974351121","doi":"10.26685/urncst.155","title":"Review: A Genetic Algorithm Approach to the Iterated Prisoner’s Dilemma","year":2019,"lang":"en","type":"article","venue":"Undergraduate Research in Natural and Clinical Science and Technology (URNCST) Journal","topic":"Evolutionary Game Theory and Cooperation","field":"Social Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"University of Windsor","keywords":"Prisoner's dilemma; Iterated function; Crossover; Dilemma; Genetic algorithm; Computer science; Population; Process (computing); Mutation; Finite-state machine; Artificial intelligence; Machine learning; Mathematical optimization; Algorithm; Mathematics; Biology; Gene; Genetics","routes":{"ca_aff":true,"ca_fund":true,"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.001230601,0.001213049,0.00171911,0.002987055,0.0003677955,0.001642537,0.001816237,0.003099516,0.003464201],"category_scores_gemma":[0.004650905,0.0003506595,0.001040082,0.004345177,0.001462166,0.001859961,0.0005304663,0.002696211,0.001521465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0018917,"about_ca_system_score_gemma":0.00246806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00320674,"about_ca_topic_score_gemma":0.002508451,"domain_scores_codex":[0.9990631,0.0003340165,0.0001355088,0.0001517771,0.0002850292,0.00003065188],"domain_scores_gemma":[0.9974484,0.0017326,0.0001961416,0.00004329089,0.0005080705,0.00007142718],"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.00007718914,0.00007643652,0.0003533388,0.02943354,0.0003822198,0.0004445011,0.0001153694,0.009158612,0.0005226613,0.03707341,0.137379,0.7849838],"study_design_scores_gemma":[0.00004442226,0.000176836,0.0009601613,0.009804457,0.0002675689,0.001586956,0.00009911082,0.003948906,0.0004045872,0.03748847,0.9451345,0.00008402479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.0001347398,0.9889424,0.003650025,0.003008904,0.001995626,0.00002150666,0.00002632579,0.00002507984,0.002195484],"genre_scores_gemma":[0.003270322,0.9890556,0.002556214,0.001634671,0.00205146,0.00004163132,0.00005067234,0.00001368823,0.00132581],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003464201,"threshold_uncertainty_score":0.01372534,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05154451918784776,"score_gpt":0.4173576611331343,"score_spread":0.3658131419452866,"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."}}