Show simple item record

dc.rights.licenseCC-BY-NC-ND
dc.contributor.advisorFrank, Jason
dc.contributor.authorVersteeg, Senne
dc.date.accessioned2024-07-11T14:02:21Z
dc.date.available2024-07-11T14:02:21Z
dc.date.issued2024
dc.identifier.urihttps://studenttheses.uu.nl/handle/20.500.12932/46671
dc.description.abstractThe thesis "Dominant Strategies in a Memory-Two Repeated Prisoner's Dilemma" by Senne Versteeg investigates optimal strategies within a memory-two iterated Prisoner's Dilemma (IPD) framework using Markov chains and numerical simulations. It focuses on how the ability to remember the outcomes of the previous two games influences strategic interactions. The research reveals that increased memory allows for more sophisticated and cooperative strategies, which are more stable against defection. The study compares these results to existing findings on memory-one IPD, highlighting the impact of enhanced memory on strategy development.
dc.description.sponsorshipUtrecht University
dc.language.isoEN
dc.subjectThis thesis analyzes optimal strategies in a memory-two Iterated Prisoner's Dilemma (IPD) using Markov chains and numerical simulations. It analyzes the development of strategies when players can remember the outcome of the previous two games.
dc.titleDominant Strategies in a Memoery-Two Repeated Prisoner's Dilemma
dc.type.contentBachelor Thesis
dc.rights.accessrightsOpen Access
dc.subject.keywordsMarkov chains; Python, Dominant Strategies, Game Theory
dc.subject.courseuuWiskunde & Toepassingen
dc.thesis.id33410


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record