Algorithmic bounded rationality, optimality and noise.
2009-05
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Algorithmic bounded rationality, optimality and noise.
Alternative title
Authors
Published Date
2009-05
Publisher
Type
Thesis or Dissertation
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.
Keywords
Description
University of Minnesota Ph.D. dissertation. May 2009. Major: Economics. Advisor: Aldo Rustichini. 1 computer file (PDF); vi, 46 pages; appendix.
Related to
Replaces
License
Collections
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Other identifiers
Suggested citation
Ioannou, Christos Andreas. (2009). Algorithmic bounded rationality, optimality and noise.. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/52115.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.