IDEAS home Printed from https://ideas.repec.org/p/hal/journl/halshs-03216538.html
   My bibliography  Save this paper

Algorithme de fictitious play et cycles

Author

Listed:
  • Richard Baron

    (CREUSET - Centre de Recherche Economique de l'Université de Saint-Etienne - UJM - Université Jean Monnet - Saint-Étienne)

  • Jacques Durieu

    (CREUSET - Centre de Recherche Economique de l'Université de Saint-Etienne - UJM - Université Jean Monnet - Saint-Étienne)

  • Philippe Solal

    (CREUSET - Centre de Recherche Economique de l'Université de Saint-Etienne - UJM - Université Jean Monnet - Saint-Étienne)

Abstract

Fudenberg et Kreps (1993), Young (1993), et Sela et Herreiner (1999) ont souligné l'insuffisance du critère de convergence en croyances du processus de Fictitious Play dans un cadre d'apprentissage des équilibres de Nash. En conséquence, nous choisissons d'étudier la convergence en stratégies du processus de Fictitious Play dans des jeux de coordination 2x2. Notre propos est de montrer que la convergence en stratégies de ce processus dépend de manière cruciale de la forme des croyances initiales des joueurs. Premièrement, lorsque les croyances initiales forment un profil de stratégies pures, nous établissons que la convergence en stratégies est certaine pour n'importe quelle catégorie de jeux de coordination. Deuxièmement, si les croyances initiales forment un profil de stratégies mixtes, le processus de Fictitious Play converge pour certaines catégories de jeux de coordination. Ainsi, nous caractérisons complètement les conditions assurant la convergence en stratégies.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Richard Baron & Jacques Durieu & Philippe Solal, 2003. "Algorithme de fictitious play et cycles," Post-Print halshs-03216538, HAL.
    • Handle: RePEc:hal:journl:halshs-03216538
    DOI: 10.3917/rel.692.0167
    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 search for a similarly titled item that would be available.

    Other versions of this item:

    More about this item

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • D83 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Search; Learning; Information and Knowledge; Communication; Belief; Unawareness

    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:hal:journl:halshs-03216538. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.