Bounded Rationality and Social Cognition: A Computational Study
This 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.
|Date of creation:||01 Apr 2001|
|Date of revision:|
|Contact details of provider:|| Web page: http://www.econometricsociety.org/conference/SCE2001/SCE2001.htmlEmail: |
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:sce:scecf1:172. See general 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.