IDEAS home Printed from https://ideas.repec.org/p/fth/pariem/97.14.html
   My bibliography  Save this paper

Repeated Proximity Games

Author

Listed:
  • Renault, J.
  • Tomala, T.

Abstract

We consider repeated games of complete information and imperfect monitoring, where the observation structure is given by a directed graph, i.e. all what a player learns are the actions taken by his neighbours on the graph. We prove that a generalized folk theorem holds if and only if the graph is 2-connected: this means that manipulation of information transmission by one player is impossible if and only if no player is essential for communication. We finally extend this result to the contexts of correlated equilibrium, sequential equilibrium and finitely repeated games.

Suggested Citation

  • Renault, J. & Tomala, T., 1997. "Repeated Proximity Games," Papiers d'Economie Mathématique et Applications 97.14, Université Panthéon-Sorbonne (Paris 1).
    • Handle: RePEc:fth:pariem:97.14
    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:

    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. Tomala, Tristan, 2009. "Perfect communication equilibria in repeated games with imperfect monitoring," Games and Economic Behavior, Elsevier, vol. 67(2), pages 682-694, November.
    3. Olivier Gossner & Rida Laraki & Tristan Tomala, 2004. "Maxmin computation and optimal correlation in repeated games with signals," Working Papers hal-00242940, HAL.
    4. Marie Laclau & Ludovic Renou & Xavier Venel, 2020. "Robust communication on networks," Papers 2007.00457, arXiv.org, revised Oct 2020.
    5. Markus Kinateder, 2006. "Repeated Games Played in a Network," UFAE and IAE Working Papers 674.06, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
    6. Laclau, M., 2014. "Communication in repeated network games with imperfect monitoring," Games and Economic Behavior, Elsevier, vol. 87(C), pages 136-160.
    7. Renault, Jerome & Tomala, Tristan, 2004. "Communication equilibrium payoffs in repeated games with imperfect monitoring," Games and Economic Behavior, Elsevier, vol. 49(2), pages 313-344, November.
    8. Olivier Gossner & Tristan Tomala, 2006. "Empirical Distributions of Beliefs Under Imperfect Observation," Mathematics of Operations Research, INFORMS, vol. 31(1), pages 13-30, February.
    9. Renault, Jérôme & Renou, Ludovic & Tomala, Tristan, 2014. "Secure message transmission on directed networks," Games and Economic Behavior, Elsevier, vol. 85(C), pages 1-18.
    10. Olivier Gossner & Tristan Tomala, 2007. "Secret Correlation in Repeated Games with Imperfect Monitoring," Mathematics of Operations Research, INFORMS, vol. 32(2), pages 413-424, May.
    11. Laclau, Marie, 2012. "A folk theorem for repeated games played on a network," Games and Economic Behavior, Elsevier, vol. 76(2), pages 711-737.
    12. 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.
    13. Tristan Tomala, 2011. "Fault Reporting in Partially Known Networks and Folk Theorems," Operations Research, INFORMS, vol. 59(3), pages 754-763, June.
    14. Nava, Francesco & Piccione, Michele, 2012. "Efficiency in repeated games with local interaction and uncertain local monitoring," LSE Research Online Documents on Economics 54250, London School of Economics and Political Science, LSE Library.
    15. Laclau, M., 2013. "Repeated games with local monitoring and private communication," Economics Letters, Elsevier, vol. 120(2), pages 332-337.
    16. Fainmesser, Itay P. & Goldberg, David A., 2018. "Cooperation in partly observable networked markets," Games and Economic Behavior, Elsevier, vol. 107(C), pages 220-237.
    17. repec:dau:papers:123456789/6102 is not listed on IDEAS
    18. King, Maia, 2020. "The probabilities of node-to-node diffusion in fixed networks," SocArXiv dfq8y, Center for Open Science.
    19. Jérôme Renault, 2001. "Learning Sets in State Dependent Signalling Game Forms: A Characterization," Mathematics of Operations Research, INFORMS, vol. 26(4), pages 832-850, November.
    20. , & ,, 2014. "Efficiency in repeated games with local interaction and uncertain local monitoring," Theoretical Economics, Econometric Society, vol. 9(1), January.
    21. Renault, Jerome & Tomala, Tristan, 2004. "Learning the state of nature in repeated games with incomplete information and signals," Games and Economic Behavior, Elsevier, vol. 47(1), pages 124-156, April.
    22. Yair Goldberg, 2003. "On the Minmax of Repeated Games with Imperfect Monitoring: A Computational Example," Discussion Paper Series dp345, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    23. Marie Laclau & Ludovic Renou & Xavier Venel, 2024. "Communication on networks and strong reliability," Working Papers hal-03099678, HAL.

    More about this item

    Keywords

    GAMES;

    JEL classification:

    • C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory
    • 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:fth:pariem:97.14. 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: Thomas Krichel (email available below). General contact details of provider: https://edirc.repec.org/data/cerp1fr.html .

    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.