Learning to play 3×3 games: Neural networks as bounded-rational players
We present a neural network methodology for learning game-playing rules in general. Existing research suggests learning to find a Nash equilibrium in a new game is too difficult a task for a neural network, but says little about what it will do instead. We observe that a neural network trained to find Nash equilibria in a known subset of games will use self-taught rules developed endogenously when facing new games. These rules are close to payoff dominance and its best response. Our findings are consistent with existing experimental results, both in terms of subject's methodology and success rates.
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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
When requesting a correction, please mention this item's handle: RePEc:eee:jeborg:v:69:y:2009:i:1:p:27-38. 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: (Shamier, Wendy)
If references are entirely missing, you can add them using this form.