Memory depth of finite state machine strategies for the iterated prisoner's dilemma

We develop an efficient algorithm to determine the memory-depth of finite state machines and apply the algorithm to a collection of iterated prisoner's dilemma strategies. The calculation agrees with the memory-depth of other representations of common strategies such as Tit-For-Tat, Tit-For-2-T...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2019-12
Main Authors: Gaffney, T J, Harper, Marc, Knight, Vincent A
Format: Article
Language:English
Subjects:
Algorithms
Finite state machines
Game theory
Lookup tables
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We develop an efficient algorithm to determine the memory-depth of finite state machines and apply the algorithm to a collection of iterated prisoner's dilemma strategies. The calculation agrees with the memory-depth of other representations of common strategies such as Tit-For-Tat, Tit-For-2-Tats, etc. which are typically represented by lookup tables. Our algorithm allows the complexity of finite state machine based strategies to be characterized on the same footing as memory-n strategies.
ISSN:2331-8422