This paper presents a neural network based methodology for examining the learning of game-playing rules in never-before seen games. A network is trained to pick Nash equilibria in a set of games and then released to play a larger set of new games. While faultlessly selecting Nash equilibria in never-before seen games is too complex a task for the network, Nash equilibria are chosen approximately 60% of the times. Furthermore, despite training the network to select Nash equilibria, what emerges are endogenously obtained bounded-rational rules which are closer to payoff dominance, and the best response to payoff dominance.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
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
This paper has been announced in the following NEP Reports:
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)