Minority games with finite score memory

Simple item page
dc.creatorChallet, Damien
dc.creatorDe Martino, Andrea
dc.creatorMarsili, Matteo
dc.creatorCastillo, Isaac Perez
dc.date2004-07-22
dc.date.accessioned2026-07-07T02:59:21Z
dc.date.available2026-07-07T02:59:21Z
dc.descriptionWe analyze grand-canonical minority games with infinite and finite score memory and different updating timescales (from `on-line' games to `batch' games) in detail with various complementary methods, both analytical and numerical. We focus on the emergence of `stylized facts' and on the production of exploitable information, as well as on the dynamic behaviour of the models. We find that with finite score memory no agent can be frozen, and that all the current analytical methods fail to provide satisfactory explanation of the observed behaviours.
dc.description12 pages, 14 figures
dc.identifierhttps://arxiv.org/abs/cond-mat/0407595
dc.identifierhttp://arxiv.org/abs/cond-mat/0407595
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/24476
dc.subjectDisordered Systems and Neural Networks
dc.subjectStatistical Mechanics
dc.titleMinority games with finite score memory
dc.typetext

Files

Collections

arXiv