IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-01252921.html

Bayesian repeated games and reputation

Author

Listed:
  • Antoine Salomon

    (LEDa - Laboratoire d'Economie de Dauphine - Université Paris Dauphine-PSL - PSL - Université Paris Sciences et Lettres)

  • Francoise Forges

    (CEREMADE - CEntre de REcherches en MAthématiques de la DEcision - Université Paris Dauphine-PSL - PSL - Université Paris Sciences et Lettres - CNRS - Centre National de la Recherche Scientifique)

Abstract

We consider two-person undiscounted and discounted infinitely repeated games in which every player privately knows his own payoffs (private values). Under a further assumption (existence of uniform punishment strategies), the Nash equilibria of the Bayesian infinitely repeated game without discounting are payoff-equivalent to tractable, completely revealing, equilibria. This characterization does not apply to discounted games with sufficiently patient players. We show that in a class of public good games, the set of Nash equilibrium payoffs of the undiscounted game can be empty, while limit (perfect Bayesian) Nash equilibrium payoffs of the discounted game, as players become increasingly patient, do exist. These equilibria share some features with the ones of two-sided reputation models.

Suggested Citation

  • Antoine Salomon & Francoise Forges, 2015. "Bayesian repeated games and reputation," Post-Print hal-01252921, HAL.
  • Handle: RePEc:hal:journl:hal-01252921
    DOI: 10.1016/j.jet.2015.05.014
    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:

    Citations

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


    Cited by:

    1. Lucas Pahl, 2021. "Information Spillover in Multiple Zero-sum Games," Papers 2111.01647, arXiv.org, revised Mar 2023.
    2. Lucas Pahl, 2024. "Information spillover in multiple zero-sum games," International Journal of Game Theory, Springer;Game Theory Society, vol. 53(1), pages 71-104, March.
    3. Françoise Forges & Ulrich Horst & Antoine Salomon, 2016. "Feasibility and individual rationality in two-person Bayesian games," International Journal of Game Theory, Springer;Game Theory Society, vol. 45(1), pages 11-36, March.

    More about this item

    JEL classification:

    • C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
    • H41 - Public Economics - - Publicly Provided Goods - - - Public Goods

    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:hal-01252921. 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.