Monte Carlo Tree Search Strategies in 2-Player Iterated Prisoner Dilemma Games

Garrison W. Greenwood, Daniel Ashlock. Monte Carlo Tree Search Strategies in 2-Player Iterated Prisoner Dilemma Games. In IEEE Conference on Games, CoG 2020, Osaka, Japan, August 24-27, 2020. pages 89-95, IEEE, 2020. [doi]

@inproceedings{GreenwoodA20,
  title = {Monte Carlo Tree Search Strategies in 2-Player Iterated Prisoner Dilemma Games},
  author = {Garrison W. Greenwood and Daniel Ashlock},
  year = {2020},
  doi = {10.1109/CoG47356.2020.9231854},
  url = {https://doi.org/10.1109/CoG47356.2020.9231854},
  researchr = {https://researchr.org/publication/GreenwoodA20},
  cites = {0},
  citedby = {0},
  pages = {89-95},
  booktitle = {IEEE Conference on Games, CoG 2020, Osaka, Japan, August 24-27, 2020},
  publisher = {IEEE},
  isbn = {978-1-7281-4533-4},
}