dc.rights.license | CC-BY-NC-ND | |
dc.contributor.advisor | Frank, Jason | |
dc.contributor.author | Versteeg, Senne | |
dc.date.accessioned | 2024-07-11T14:02:21Z | |
dc.date.available | 2024-07-11T14:02:21Z | |
dc.date.issued | 2024 | |
dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/46671 | |
dc.description.abstract | The 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.sponsorship | Utrecht University | |
dc.language.iso | EN | |
dc.subject | This 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.title | Dominant Strategies in a Memoery-Two Repeated Prisoner's Dilemma | |
dc.type.content | Bachelor Thesis | |
dc.rights.accessrights | Open Access | |
dc.subject.keywords | Markov chains; Python, Dominant Strategies, Game Theory | |
dc.subject.courseuu | Wiskunde & Toepassingen | |
dc.thesis.id | 33410 | |