Symbolic Dynamics for Discrete Adaptive Games

Details Symbolic Dynamics for Discrete Adaptive Games Symbolic Dynamics for Discrete Adaptive Games

2002-07-17

arxiv.org/abs/cond-mat/0207407v2

Physics

Condensed Matter

Statistical Mechanics

8 pages, no figures, RevTeX, submitted to PRE. v2: Improved and expanded discussion of symbolic dynamics, complexity and bound

Scientific paper

We use symbolic dynamics to study discrete adaptive games, such as the minority game and the El Farol Bar problem. We show that no such game can have deterministic chaos. We put upper bounds on the statistical complexity and period of these games; the former is at most linear in the number agents and the size of their memories. We extend our results to cases where the players have infinite-duration memory (they are still non-chaotic) and to cases where there is ``noise'' in the play (leaving the complexity unchanged or even reduced). We conclude with a mechanism that can reconcile our findings with the phenomenology, and reflections on the merits of simple models of mutual adaptation.

Affiliated with

Also associated with

No associations

Rating

Symbolic Dynamics for Discrete Adaptive Games does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Symbolic Dynamics for Discrete Adaptive Games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Symbolic Dynamics for Discrete Adaptive Games will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-561524