Evidence map›Paper›PMID 29228001›Full record

ArticlePloS one2017

Reinforcement learning produces dominant strategies for the Iterated Prisoner's Dilemma.

Marc Harper, Vincent Knight, Martin Jones, Georgios Koutsovoulos, Nikoleta E Glynatsi, Owen Campbell

Abstract read
In one paragraph

Article in PloS one, 2017. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 14 papers.

0numbers the graph read from it
0cells of the map it votes in
14citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

14 citing papers in PubMed.

  1. On the optimal integration of intelligent agents into network systems to steer cooperation.Proceedings of the National Academy of Sciences of the United States of America · 2026
    Article
  2. Article
  3. Conditional cooperation with longer memory.Proceedings of the National Academy of Sciences of the United States of America · 2024
    Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

6 authors.

Marc HarperGoogle Inc., Mountain View, CA, United States of America.
Vincent KnightCardiff University, School of Mathematics, Cardiff, United Kingdom.ORCID http://orcid.org/0000-0002-4245-0638
Martin JonesIndependent Researcher, Edinburgh, Scotland.
Georgios KoutsovoulosINRA, Université Côte d'Azur, CNRS, ISA, Nice, France.
Nikoleta E GlynatsiCardiff University, School of Mathematics, Cardiff, United Kingdom.
Owen CampbellIndependent Researcher, Chester, United Kingdom.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

We present tournament results and several powerful strategies for the Iterated Prisoner's Dilemma created using reinforcement learning techniques (evolutionary and particle swarm algorithms). These strategies are trained to perform well against a corpus of over 170 distinct opponents, including many well-known and classic strategies. All the trained strategies win standard tournaments against the total collection of other opponents. The trained strategies and one particular human made designed strategy are the top performers in noisy tournaments also.

Indexed as

LearningPrisoner DilemmaAlgorithmsGame TheoryHumans

Identifiers

PMID29228001
PMCPMC5724862

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.