The common-knowledge operator captures a specific kind of shared knowledge in groups: not just that everyone knows something, but that everyone knows that everyone knows it, everyone knows that everyone knows that everyone knows it, and so on infinitely. Formally introduced by Robert Aumann in 1976, it's defined by taking the reflexive-transitive closure of individual agents' knowledge relations in a Kripke model (a graph where nodes are possible worlds and edges represent what agents can't distinguish). This concept is foundational for understanding coordination, game-theoretic reasoning about rational agents, and what must be true for groups to reach agreement.
Main takeaways:
- Infinite hierarchy requirement: Common knowledge means not just shared knowledge, but knowledge of shared knowledge, knowledge of knowledge of shared knowledge, etc. — an infinite chain that must all hold
- Formal definition via closure: In Kripke semantics, C_G p holds when p is true at all worlds reachable by any sequence of knowledge-accessibility relations for agents in group G
- Coordination necessity: Common knowledge is often a prerequisite for coordinated action — if I don't know that you know that I know the meeting time, we might not both show up
- Aumann's agreement theorem: If two rational agents have common knowledge of each other's posteriors (updated beliefs) on a proposition, they cannot agree to disagree — their posteriors must be identical
- Proof-theoretic formulation: Can be axiomatized with fixed-point axioms or induction principles that capture the infinite nature of common knowledge without explicitly quantifying over all levels
Resources: