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

Secret Correlation in Repeated Games with Imperfect Monitoring

Author

Listed:
  • Olivier Gossner

    (PJSE - Paris-Jourdan Sciences Economiques - ENS-PSL - École normale supérieure - Paris - PSL - Université Paris Sciences et Lettres - EHESS - École des hautes études en sciences sociales - ENPC - École des Ponts ParisTech - CNRS - Centre National de la Recherche Scientifique, MEDS, Northwestern University - Northwestern University, PSE - Paris School of Economics - UP1 - Université Paris 1 Panthéon-Sorbonne - ENS-PSL - École normale supérieure - Paris - PSL - Université Paris Sciences et Lettres - EHESS - École des hautes études en sciences sociales - ENPC - École des Ponts ParisTech - CNRS - Centre National de la Recherche Scientifique - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement)

  • Tristan Tomala

    (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 characterize the maximum payoff that a team can guarantee against another in a class of repeated games with imperfect monitoring. Our result relies on the optimal tradeoff for the team between optimization of stage payoffs and generation of signals for future correlation.

Suggested Citation

  • Olivier Gossner & Tristan Tomala, 2007. "Secret Correlation in Repeated Games with Imperfect Monitoring," PSE-Ecole d'économie de Paris (Postprint) hal-00487954, HAL.
    • Handle: RePEc:hal:pseptp:hal-00487954
    DOI: 10.1287/moor.1060.0248
    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.

    Citations

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


    Cited by:

    1. Deb, Joyee & González-Díaz, Julio & Renault, Jérôme, 2016. "Uniform folk theorems in repeated anonymous random matching games," Games and Economic Behavior, Elsevier, vol. 100(C), pages 1-23.
    2. Bavly, Gilad & Peretz, Ron, 2019. "Limits of correlation in repeated games with bounded memory," Games and Economic Behavior, Elsevier, vol. 115(C), pages 131-145.
    3. Nora, Vladyslav & Uno, Hiroshi, 2014. "Saddle functions and robust sets of equilibria," Journal of Economic Theory, Elsevier, vol. 150(C), pages 866-877.
    4. Valizadeh, Mehrdad & Gohari, Amin, 2019. "Playing games with bounded entropy," Games and Economic Behavior, Elsevier, vol. 115(C), pages 363-380.
    5. Mehrdad Valizadeh & Amin Gohari, 2021. "Simulation of a Random Variable and its Application to Game Theory," Mathematics of Operations Research, INFORMS, vol. 46(2), pages 452-470, May.
    6. Jérôme Renault & Tristan Tomala, 2011. "General Properties of Long-Run Supergames," Dynamic Games and Applications, Springer, vol. 1(2), pages 319-350, June.
    7. Heng Liu, 2017. "Correlation and unmediated cheap talk in repeated games with imperfect monitoring," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(4), pages 1037-1069, November.
    8. Kutay Cingiz & János Flesch & P. Jean-Jacques Herings & Arkadi Predtetchinski, 2020. "Perfect information games where each player acts only once," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 69(4), pages 965-985, June.
    9. Ron Peretz, 2011. "Correlation through Bounded Recall Strategies," Discussion Paper Series dp579, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    10. Le Treust, Maël & Tomala, Tristan, 2019. "Persuasion with limited communication capacity," Journal of Economic Theory, Elsevier, vol. 184(C).
    11. Jiaying Deng & Hossein Ghasemkhani & Yong Tan & Arvind K Tripathi, 2023. "Actions speak louder than words: Imputing users’ reputation from transaction history," Production and Operations Management, Production and Operations Management Society, vol. 32(4), pages 1096-1111, April.
    12. Olivier Gossner & Penélope Hernández & Ron Peretz, 2016. "The complexity of interacting automata," International Journal of Game Theory, Springer;Game Theory Society, vol. 45(1), pages 461-496, March.
    13. Ron Peretz, 2013. "Correlation through bounded recall strategies," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(4), pages 867-890, November.
    14. Bavly, Gilad & Neyman, Abraham, 2014. "Online concealed correlation and bounded rationality," Games and Economic Behavior, Elsevier, vol. 88(C), pages 71-89.

    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:pseptp:hal-00487954. 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: Caroline Bauer (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.