Lexicographic agreeing to disagree and perfect equilibrium

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.