University of Twente Student Theses
Weak acyclicity of the iterated prisoner’s dilemma with a memory of one period.
Koorn, Daan (2023) Weak acyclicity of the iterated prisoner’s dilemma with a memory of one period.
|
PDF
1MB |
| Abstract: | I develop a Python algorithm that visualizes the combined state values of the ϵ-greedy policies of an iterated prisoner’s dilemma with a memory of one period. From this one can read the best response to a given policy of the opposing player. I also attempt to show that the iterated prisoner’s dilemma is weakly acyclic. This can be done by constructing a potential function for the game. The two candidate functions explored turn out not to be potential functions. The approach developed here does however lend itself to extensions to games with more states and actions. |
| Item Type: | Essay (Bachelor) |
| Faculty: | EEMCS: Electrical Engineering, Mathematics and Computer Science |
| Subject: | 31 mathematics |
| Programme: | Applied Mathematics BSc (56965) |
| Link to this item: | https://purl.utwente.nl/essays/96298 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page