IDEAS home Printed from https://ideas.repec.org/a/bla/ijethy/v10y2014i3p235-262.html
   My bibliography  Save this article

Cooperation in the repeated prisoner's dilemma game with local interaction and local communication

Author

Listed:
  • Myeonghwan Cho

Abstract

type="main" xml:lang="en"> This paper considers a repeated prisoner's dilemma game in a network in which each agent interacts with his neighbors and cannot observe the actions of other agents who are not directly connected to him. If there is global information processing through public randomization and global communication, it is not difficult to construct a sequential equilibrium which supports cooperation and satisfies a property, called stability, which requires that cooperation resumes after any history. In this paper, we allow agents to locally communicate with their neighbors and show that it is possible to construct such an equilibrium without global information processing. Here, the role of local communication is to resolve the discrepancy of agents’ expectations about their neighbor's future actions.

Suggested Citation

  • Myeonghwan Cho, 2014. "Cooperation in the repeated prisoner's dilemma game with local interaction and local communication," International Journal of Economic Theory, The International Society for Economic Theory, vol. 10(3), pages 235-262, September.
  • Handle: RePEc:bla:ijethy:v:10:y:2014:i:3:p:235-262
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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. Wyka Sylwester, 2019. "The Possibility of Overcoming Barriers in International Cooperation in the Area of R&D from the Point of View of a Research Unit, Based on the Example of the Institute of Aviation," Marketing of Scientific and Research Organizations, Sciendo, vol. 31(1), pages 173-188, March.
    2. , & ,, 2014. "Efficiency in repeated games with local interaction and uncertain local monitoring," Theoretical Economics, Econometric Society, vol. 9(1), January.
    3. Saurabh Shanu & Alok Agarwal, 2023. "A Computational Model for Determining Tiger Dispersal and Related Patterns in a Landscape Complex," Sustainability, MDPI, vol. 15(11), pages 1-18, May.

    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:bla:ijethy:v:10:y:2014:i:3:p:235-262. 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: Wiley Content Delivery (email available below). General contact details of provider: http://www.blackwellpublishing.com/journal.asp?ref=1742-7355 .

    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.