IDEAS home Printed from https://ideas.repec.org/a/kap/compec/v18y2001i1p89-110.html
   My bibliography  Save this article

Reinforcement Learning Rules in a Repeated Game

Author

Listed:
  • Bell, Ann Maria

Abstract

This paper examines the performance of simple reinforcement learning algorithms in a stationary environment and in a repeated game where the environment evolves endogenously based on the actions of other agents. Some types of reinforcement learning rules can be extremely sensitive to small changes in the initial conditions, consequently, events early in a simulation can affect the performance of the rule over a relatively long time horizon. However, when multiple adaptive agents interact, algorithms that performed poorly in a stationary environment often converge rapidly to a stable aggregate behaviors despite the slow and erratic behavior of individual learners. Algorithms that are robust in stationary environments can exhibit slow convergence in an evolving environment. Copyright 2001 by Kluwer Academic Publishers

Suggested Citation

  • Bell, Ann Maria, 2001. "Reinforcement Learning Rules in a Repeated Game," Computational Economics, Springer;Society for Computational Economics, vol. 18(1), pages 89-110, August.
  • Handle: RePEc:kap:compec:v:18:y:2001:i:1:p:89-110
    as

    Download full text from publisher

    File URL: http://journals.kluweronline.com/issn/0927-7099/contents
    Download Restriction: Access to the full text of the articles in this series is restricted.
    ---><---

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Waltman, Ludo & Kaymak, Uzay, 2008. "Q-learning agents in a Cournot oligopoly model," Journal of Economic Dynamics and Control, Elsevier, vol. 32(10), pages 3275-3293, October.
    2. Pietro Dindo & Jan Tuinstra, 2011. "A Class of Evolutionary Models for Participation Games with Negative Feedback," Computational Economics, Springer;Society for Computational Economics, vol. 37(3), pages 267-300, March.
    3. Darmon, Eric & Waldeck, Roger, 2005. "Convergence of reinforcement learning to Nash equilibrium: A search-market experiment," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 355(1), pages 119-130.
    4. Stefano Balbi & Carlo Giupponi, 2009. "Reviewing agent-based modelling of socio-ecosystems: a methodology for the analysis of climate change adaptation and sustainability," Working Papers 2009_15, Department of Economics, University of Venice "Ca' Foscari".

    More about this item

    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:kap:compec:v:18:y:2001:i:1:p:89-110. 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.