Bounded-Rational Behavior by Neural Networks in Normal Form Games
Abstract
This paper presents a neural network model developed to simulate the endogenous emergence of bounded-rational behavior in normal-form games. There exists an algorithm which, if learnt by a neural network, would enable it to perfectly select Nash equilibria in never before seen games. However, finding this algorithm is too complex a task for a biologically plausible network, and as such it will instead settle for converging to an approximation to Nash in a subset of games. We employ computer simulations to show that Nash equilibria are found approximately 60% of the times, and to characterize the behavioural heuristics acquired by the bounded-rational agent. Pure sum of payoffs dominance, and the best response to this strategy, get closest to predicting the networks behavior.Download Info
If 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 Info
Paper provided by University of Oxford, Department of Economics in its series Economics Series Working Papers with number 2000-W30.Length:
Date of creation: 01 Mar 2001
Date of revision:
Handle: RePEc:oxf:wpaper:2000-w30
Contact details of provider:
Postal: Manor Rd. Building, Oxford, OX1 3UQ
Email:
Web page: http://www.economics.ox.ac.uk/
More information through EDIRC
Related research
Keywords: rationality; learning; neural networks; normal form games; complexity;Find related papers by JEL classification:
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
- D00 - Microeconomics - - General - - - General
- D83 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Search, Learning, and Information
References
No references listed on IDEASYou can help add them by filling out this form.
Citations
Lists
This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.Statistics
Access and download statisticsCorrections
When requesting a correction, please mention this item's handle: RePEc:oxf:wpaper:2000-w30For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Caroline Wise).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.

