A neural networks approach to minority game
The minority game (MG) comes from the so-called “El Farol bar” problem by W.B. Arthur. The underlying idea is competition for limited resources and it can be applied to different fields such as: stock markets, alternative roads between two locations and in general problems in which the players in the “minority” win. Players in this game use a window of the global history for making their decisions, we propose a neural networks approach with learning algorithms in order to determine players strategies. We use three different algorithms to generate the sequence of minority decisions and consider the prediction power of a neural network that uses the Hebbian algorithm. The case of sequences randomly generated is also studied.
KeywordsMinority game Learning algorithms Neural networks
- 1.Arthur WB (1994) Inductive reasoning and bounded rationality. In: Krugman (ed) Am Econ Assoc Papers and Proc, pp 88–406Google Scholar
- 5.Hart M, Jefferies P, Johnson NF, Hui PM (2000) Crowd-anticrowd model of the minority game, cond-mat/0003486Google Scholar
- 6.Hertz J, Krogh A, Palmer RG (1991) Introduction to the theory of neural computation. Addison-Wesley, Redwood CityGoogle Scholar
- 8.Metzler R (2002) Neural Networks, Game Theory and Time Series Generation. Dissertation, cond-mat/0212486Google Scholar