A SIMPLE FORECASTING GAME

M. Andrecut ()
Additional contact information
M. Andrecut: Institute for Biocomplexity and Informatics, University of Calgary, 2500 University Drive NW, Calgary, Alberta, T2N 1N4, Canada

International Journal of Modern Physics C (IJMPC), 2006, vol. 17, issue 02, 279-286

Abstract: We consider a population of Boolean agents playing a simple forecasting game, in which the goal of each agent is to give a correct forecast of the future state of its neighbors. The numerical results show that by using a simple inductive learning algorithm the agents are able to accurately achive the goal of the game. However, this remarkable performance has an unexpected consequence: by learning to forecast the future, the agents dynamics freezes up at the end of the game; the only way to regain their dynamics is to forget what they have learned.

Keywords: Stochastic games; forecasting; agent dynamics; reinforcement learning; 05.45.-a; 89.75.Fb (search for similar items in EconPapers)
Date: 2006
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183106009047
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:17:y:2006:i:02:n:s0129183106009047

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183106009047

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().