IDEAS home Printed from https://ideas.repec.org/a/spr/dyngam/v14y2024i3d10.1007_s13235-023-00513-y.html
   My bibliography  Save this article

Deterministic Approximation of a Stochastic Imitation Dynamics with Memory

Author

Listed:
  • Ozgur Aydogmus

    (University of Ankara)

  • Yun Kang

    (Arizona State University)

Abstract

We provide results of a deterministic approximation for non-Markovian stochastic processes modeling finite populations of individuals who recurrently play symmetric finite games and imitate each other according to payoffs. We show that a system of delay differential equations can be obtained as the deterministic approximation of such a non-Markovian process. We also show that if the initial states of stochastic process and the corresponding deterministic model are close enough, then the trajectory of stochastic process stays close to that of the deterministic model up to any given finite time horizon with a probability exponentially approaching one as the population size increases. We use this result to obtain that the lower bound of the population size on the absorption time of the non-Markovian process is exponentially increasing. Additionally, we obtain the replicator equations with distributed and discrete delay terms as examples and analyze how the memory of individuals can affect the evolution of cooperation in a two-player symmetric snow-drift game. We investigate the stability of the evolutionary stable state of the game when agents have the memory of past population states, and implications of these results are given for the stochastic model.

Suggested Citation

  • Ozgur Aydogmus & Yun Kang, 2024. "Deterministic Approximation of a Stochastic Imitation Dynamics with Memory," Dynamic Games and Applications, Springer, vol. 14(3), pages 525-548, July.
  • Handle: RePEc:spr:dyngam:v:14:y:2024:i:3:d:10.1007_s13235-023-00513-y
    DOI: 10.1007/s13235-023-00513-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13235-023-00513-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s13235-023-00513-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:dyngam:v:14:y:2024:i:3:d:10.1007_s13235-023-00513-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.