On the Dynamics of Finite Memory Distributed Systems
AbstractWe consider a kinetic equation approach to dynamical systems with finite memory, based upon a probabilistic approach given in Dorofeenko and Shorish (2004). This approach uses a master equation methodology to analytically model the dynamics of distributed systems with many heterogeneous agents, each agent possessing a fixed (zero-memory) strategy for pairwise interaction. The methodology allows one to consider spatially distributed populations of agents in a continuous spaceâ€“continuous time model. We extend the techniques of this approach to models where agents may possess a finite memory of their encounters with other agents. This allows the analytical modeling of, for example, the 'tit-for-tat' strategy in a repeated Prinsonerâ€™s Dilemma game, where agents remember their most recent encounter. We demonstrate that models of finite agent memory, where the outcome is determined by pairwise interactions between agents, lead to the emergence of collective (probabilistic) structures in both time and space. We also show that this extension requires a suitable redefinition of the 'characteristic time' of the system, in order to arrive at an analogue of the master equation in the fixed strategy environment.
Download InfoTo our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Bibliographic InfoPaper provided by Society for Computational Economics in its series Computing in Economics and Finance 2004 with number 298.
Date of creation: 11 Aug 2004
Date of revision:
master equation; finite memory; distributed system;
Find related papers by JEL classification:
- C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
- C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (Christopher F. Baum).
If references are entirely missing, you can add them using this form.