MétaCan
Menu
Back to cohort

An evaluation of reinforcement learning performance in the iterated prisoner’s dilemma

2023· article· en· W4389482477 on OpenAlex
Yifan Sun

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueTheoretical and Natural Science · 2023
Typearticle
Languageen
FieldComputer Science
TopicReinforcement Learning in Robotics
Canadian institutionsUniversity of Toronto
FundersUniversity of Cambridge
KeywordsReinforcement learningDilemmaIterated functionPrisoner's dilemmaReinforcementComputer scienceArtificial neural networkArtificial intelligencePsychologySocial psychologyMathematics

Abstract

fetched live from OpenAlex

This paper uses recurrent neural network-based reinforcement learning to play Iterated Prisoner’s Dilemma against different game theory strategies. Multiple experiments are carried out to compare the performance of the reinforcement learning agents, e.g., RL-agent vs. Tit for Tat, RL-agent vs. Grudge, RL-agent vs. Tit for Tat then Defect, RL-agent vs. Cooperate or Defect. It shows that both DQN and PPO agent would receive the highest reward by playing against a Tit for Tat agent in Iterated Prisoner Dilemma. Furthermore, DQN agent would perform better, by receiving higher mean episode reward compared to PPO agent.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.006
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.524
Threshold uncertainty score0.279

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0060.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.002
Science and technology studies0.0000.001
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.018
GPT teacher head0.295
Teacher spread0.277 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it