IDEAS home Printed from https://ideas.repec.org/a/eee/jetheo/v221y2024ics0022053124000966.html
   My bibliography  Save this article

Communication games, sequential equilibrium, and mediators

Author

Listed:
  • Geffner, Ivan
  • Halpern, Joseph Y.

Abstract

We consider k-resilient sequential equilibria, strategy profiles where no player in a coalition of at most k players believes that it can increase its utility by deviating, regardless of its local state. We prove that all k-resilient sequential equilibria that can be implemented with a trusted mediator can also be implemented without the mediator if n>3k. These results match the lower bounds given by Abraham et al. (2008) for implementing a Nash equilibrium without a mediator (which are easily seen to apply to implementing a sequential equilibrium) and improve the results of Gerardi (2004), who showed that, in the case that k=1, a sequential equilibrium can be implemented in synchronous systems if n≥5.

Suggested Citation

  • Geffner, Ivan & Halpern, Joseph Y., 2024. "Communication games, sequential equilibrium, and mediators," Journal of Economic Theory, Elsevier, vol. 221(C).
    • Handle: RePEc:eee:jetheo:v:221:y:2024:i:c:s0022053124000966
    DOI: 10.1016/j.jet.2024.105890
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0022053124000966
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.jet.2024.105890?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:eee:jetheo:v:221:y:2024:i:c:s0022053124000966. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622869 .

    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.