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

Lexicographic agreeing to disagree and perfect equilibrium

Author

Listed:
  • Bach, Christian W.
  • Cabessa, Jérémie

Abstract

Aumann’s seminal agreement theorem deals with the impossibility for agents to acknowledge their distinct posterior beliefs. We consider agreeing to disagree in an extended framework with lexicographic probability systems. A weak agreement theorem in the sense of identical posteriors only at the first lexicographic level obtains. Somewhat surprisingly, a possibility result does emerge for the deeper levels. Agents can agree to disagree on their posteriors beyond the first lexicographic level. By means of mutual absolute continuity as an additional assumption, a strong agreement theorem with equal posteriors at every lexicographic level ensues. Subsequently, we turn to games and provide epistemic conditions for the classical solution concept of perfect equilibrium. Our lexicographic agreement theorems turn out to be pivotal in this endeavour. The hypotheses of mutual primary belief in caution, mutual primary belief in rationality, and common knowledge of conjectures characterize perfect equilibrium epistemically in our lexicographic framework.

Suggested Citation

  • Bach, Christian W. & Cabessa, Jérémie, 2023. "Lexicographic agreeing to disagree and perfect equilibrium," Journal of Mathematical Economics, Elsevier, vol. 109(C).
    • Handle: RePEc:eee:mateco:v:109:y:2023:i:c:s0304406823001015
    DOI: 10.1016/j.jmateco.2023.102908
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304406823001015
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.jmateco.2023.102908?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:mateco:v:109:y:2023:i:c:s0304406823001015. 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/jmateco .

    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.