Bounded Rationality and Social Cognition: A Computational Study
AbstractThis paper examines the implications of a 'strong' version of bounded rationality popular within computational and evolutionary game theory in which agents are represented by finite automata. It is argued that this view has unrealistic features in that agents of this kind are unable to distinguish between opponent or game types. An alternative view of bounded rationality from social cognition accommodating opponent-specific choices is presented and analyzed by computer simulation.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Society for Computational Economics in its series Computing in Economics and Finance 2001 with number 172.
Date of creation: 01 Apr 2001
Date of revision:
Contact details of provider:
Web page: http://www.econometricsociety.org/conference/SCE2001/SCE2001.html
More information through EDIRC
bounded rationality; social cognition; genetic algorithm;
Find related papers by JEL classification:
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
- J71 - Labor and Demographic Economics - - Labor Discrimination - - - Hiring and Firing
This paper has been announced in the following NEP Reports:
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christopher F. Baum).
If references are entirely missing, you can add them using this form.