IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v34y2023i07ns0129183123500924.html
   My bibliography  Save this article

The reinforcement learning model with heterogeneous learning rate in activity-driven networks

Author

Listed:
  • Dun Han

    (School of Mathematical Sciences, Jiangsu University, Zhenjiang, Jiangsu 212013, P. R. China)

  • Youxin He

    (School of Mathematical Sciences, Jiangsu University, Zhenjiang, Jiangsu 212013, P. R. China)

Abstract

Agent’s learning behavior usually presents biased judgments influenced by many internal and external reasons, we incorporate an improved Q-learning algorithm in the reinforcement learning which is examined with the prisoner’s dilemma game in an activity-driven networks. The heterogeneous learning rate and ϵ-greedy exploration mechanism are taken into account while modeling decision-making of agents. Simulation results show the proposed reinforcement learning mechanism is conducive to the emergence of defective behavior, i.e. it could maximize one’s expected payoff regardless of its neighbors’ strategy. In addition, we find the temptation gain, vision level and the number of connected edges of activated agents are proportional to the density of defectors. Interestingly, when the inherent learning rate is small, the increase of exploration rate can demote the appearance of defectors, and the decrease of defectors is insignificant by increasing of exploration rate conversely.

Suggested Citation

  • Dun Han & Youxin He, 2023. "The reinforcement learning model with heterogeneous learning rate in activity-driven networks," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 34(07), pages 1-11, July.
  • Handle: RePEc:wsi:ijmpcx:v:34:y:2023:i:07:n:s0129183123500924
    DOI: 10.1142/S0129183123500924
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183123500924
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1142/S0129183123500924?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:wsi:ijmpcx:v:34:y:2023:i:07:n:s0129183123500924. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    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.