IDEAS home Printed from https://ideas.repec.org/p/sce/scecfa/333.html

Finite Memory Distributed Systems

Author

Listed:
  • Victor Dorofeenko

    (Insitute for Advanced Studies, Vienna)

  • Jamsheed Shorish

    (Insitute for Advanced Studies, Vienna)

Abstract

A distributed system model is studied, where individual agents engage in repeated play against each other and can change their strategies based upon previous play. Similar to Dorofeenko and Shorish (2005), it is shown how to model this environment in terms of continuous population densities (probabilities) 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 and the rate of this imitation is high enough, the system of master equations which govern the dynamical evolution of agent populations can be reduced with high precision to one equation for the total population. In a sense, the dynamics of the full system can '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

Suggested Citation

  • Victor Dorofeenko & Jamsheed Shorish, 2006. "Finite Memory Distributed Systems," Computing in Economics and Finance 2006 333, Society for Computational Economics.
    • Handle: RePEc:sce:scecfa:333
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below 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
    for a similarly titled item that would be available.

    Other versions of this item:

    More about this item

    Keywords

    ;
    ;
    ;

    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

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sce:scecfa:333. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Christopher F. Baum (email available below). General contact details of provider: https://edirc.repec.org/data/sceeeea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.