Finite Memory Distributed Systems
A distributed system model is studied, where individual agents play repeatedly against each other and change their strategies based upon previous play. It is shown how to model this environment in terms of continuous population densities of agent types. A complication arises because the population densities of different strategies depend upon each other not only through game payoffs, but also through the strategy distributions themselves. In spite of this, it is shown that when an agent imitates the strategy of his previous opponent at a sufficiently high rate, the system of equations which governs the dynamical evolution of agent populations can be reduced to one equation for the total population. In a sense, the dynamics 'collapse' to the dynamics of the entire system taken as a whole, which describes the behavior of all types of agents. We explore the implications of this model, and present both analytical and simulation results.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 6 (2006)
Issue (Month): 1 (December)
|Contact details of provider:|| Web page: http://www.degruyter.com|
|Order Information:||Web: http://www.degruyter.com/view/j/bejte|
When requesting a correction, please mention this item's handle: RePEc:bpj:bejtec:v:contributions.6:y:2006:i:1:n:14. See general 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: (Peter Golla)
If references are entirely missing, you can add them using this form.