Back to search

University of Minnesota

Algorithmic bounded rationality, optimality and noise.

Abstract

dc:description.abstract

A model of learning, adaptation and innovation is used to simulate the evolution of Moore machines(executing strategies) in the repeated Prisoner's Dilemma stage-game. In contrast to previous simulations that assumed perfect informational and implementation accuracy, the agents' machines are prone to two types of errors: (a) action-implementation errors, and (b) perception errors. The impact of bounded rationality on the agents' machines is examined under different error-levels. The computations indicate that the incorporation of bounded rationality is sufficient to alter the evolutionary structure of the agents' machines. In particular, the evolution of cooperative machines becomes less likely as the likelihood of errors increases.

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Ioannou, Christos Andreas

Subjects

dc:subject × 1

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Dc Identifier Citation
Ioannou, Christos Andreas. (2009). Algorithmic bounded rationality, optimality and noise.. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/52115.

Chain of custody

source
Harvested from
University of Minnesota
Base URL
conservancy.umn.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Ioannou, Christos Andreas. Algorithmic bounded rationality, optimality and noise.. 2009. http://purl.umn.edu/52115