Fact-checked by Grok 2 weeks ago

Common knowledge

Common knowledge is a foundational concept in , logic, and , referring to a of shared among a group of agents where a p is known by everyone, known by everyone that it is known by everyone, known by everyone that it is known that it is known by everyone, and so on ad infinitum. This infinite hierarchy distinguishes common knowledge from mere mutual knowledge, which stops at finite levels of , and ensures that all agents can reason about each other's awareness without uncertainty. The idea was first systematically explored by philosopher David Lewis in his 1969 work , where he applied it to explain social conventions as solutions to recurrent coordination problems, such as driving on the same side of the road, emphasizing that conventions require this deep level of mutual understanding to stabilize behavior. In , common knowledge underpins the analysis of rational play and equilibrium concepts, as formalized by in his 1976 paper "Agreeing to Disagree," which demonstrated that if two agents with common priors have common knowledge of their posterior beliefs about an event, those posteriors must be identical, ruling out rational disagreement on shared information. This assumption is essential for models of strategic interaction, including Nash equilibria in complete-information games, where players' payoffs, strategies, and rationality are mutually known to infinite depths, enabling predictions of coordinated outcomes in scenarios like the or electronic mail game. Without common knowledge, even slight uncertainties can lead to coordination failures, as illustrated by the "two generals' paradox," where messengers fail to confirm mutual receipt of orders despite multiple confirmations. Epistemologically, common knowledge addresses challenges in collective justification and trust, linking to Ludwig Wittgenstein's notion of "hinge propositions"—foundational certainties like "the exists" that are taken for granted in shared practices without needing iterative proof. Recent analyses, such as those connecting it to hinge epistemology, argue that common knowledge functions as a collective "scaffold" for rational deliberation, resolving infinite regresses by treating it as an uncontroversial background assumption rather than derived . Its applications extend beyond theory to fields like , (e.g., distributed systems), and social sciences, where it models how shared beliefs sustain norms, markets, and communication protocols.

Fundamentals

Definition

Common knowledge of a p in a group refers to a state in which every member of the group knows p, every member knows that every other member knows p, every member knows that every other member knows that every other member knows p, and this process continues through arbitrary finite levels of , forming an infinite hierarchy of mutual . This recursive structure ensures that the knowledge is not merely held individually but is iteratively recognized across the entire group without bound. Unlike mutual knowledge, which requires only that all members know p and recognize this up to a finite number of levels (such as everyone knows p and knows that others know p), common knowledge demands this infinite iteration and public accessibility, where the proposition is treated as openly available to all without private reservations. Mutual knowledge may suffice for basic coordination but fails to capture the full depth needed for scenarios requiring complete alignment, as it does not guarantee awareness of others' awareness . The concept originates in David Lewis's analysis of conventions, where such infinite hierarchies underpin social regularities. Common knowledge is inherently contextual, defined relative to a specific , temporal setting, and situational , where the proposition must be publicly known rather than privately inferred or assumed. This dependency means that what constitutes common knowledge can vary with the group's shared background and the of , ensuring it aligns with the collective epistemic environment rather than isolated individual beliefs.

Historical Origins

The concept of common knowledge in and began to take shape in the mid-20th century through discussions of coordination and mutual expectations in strategic interactions. In his 1960 book The Strategy of Conflict, explored focal points—salient solutions that individuals intuitively select in coordination problems without explicit communication—laying essential groundwork for understanding how shared expectations enable . Schelling's analysis emphasized that successful coordination relies on participants recognizing mutually salient options, predating the formal notion of common knowledge but highlighting the iterative layers of awareness required for such recognition. A pivotal advancement came in 1969 with David Lewis's Convention: A Philosophical Study, which established common knowledge as a cornerstone for explaining social . Lewis defined , such as linguistic and behavioral standards, as regularities arising from interdependent decisions where participants conform because they expect others to do the same, with this expectation being common knowledge among them. He argued that without common knowledge of these mutual expectations, could not stabilize, as deviations would undermine the shared rationale for adherence; this framework extended to broader social phenomena like signaling and norm enforcement. The logical formalization of common emerged in 1976 through Robert Aumann's work in epistemic logic, providing a rigorous structure for the infinite hierarchy of mutual beliefs. In his paper "Agreeing to Disagree," Aumann introduced a model where common knowledge of an event requires not only that all parties know it, but also that they know that others know it, and so on indefinitely, using partitions of possibility spaces to represent states. This recursive , while primarily demonstrated in contexts of rational belief updating, offered a precise tool for analyzing epistemic conditions in interactive settings, influencing subsequent developments in logic and beyond.

Epistemological Variations

Instability Over Time

Common knowledge, defined by its recursive structure where not only is a proposition known by all members of a group but also known to be known iteratively to any depth, proves vulnerable to temporal disruptions that break this infinite hierarchy. In pre-Copernican Europe, the —positing Earth as the universe's center with celestial bodies orbiting it—was the accepted cosmological framework, publicly taught and endorsed by religious and scholarly authorities, thus constituting common knowledge across society. This shifted dramatically during the 16th- and 17th-century , as evidence from Copernicus's heliocentric theory, Galileo's telescopic observations, and Kepler's laws invalidated the model, eroding its status through widespread dissemination in academic circles and eventual public acceptance. Mechanisms driving such changes often involve the propagation of new information via structured channels like , , and pivotal events, which rebuild or dismantle the recursive layers of awareness. Formal systems, for instance, integrate updated propositions into curricula, ensuring iterative knowledge among students and educators over generations. outlets amplify this by verifiable facts to mass audiences, fostering mutual recognition. A prime example is the 1969 , viewed live by an estimated 600–650 million people globally, which rapidly established facts about human space travel—such as the Moon's distance and surface composition—as common knowledge in Western societies through television and subsequent reporting. Philosophically, this instability underscores the non-permanent nature of common knowledge in , requiring continuous public reinforcement to sustain its status amid evolving evidence or contexts. As argued by Paternotte, common knowledge exhibits inherent fragility, eroding with epistemic shifts like changes in group awareness or contextual factors, which challenge its robustness as a distinct attitude compared to individual knowledge. This impermanence highlights the dynamic interplay between societal reinforcement and disruptive information, positioning common knowledge not as an eternal fixture but as a provisional epistemic construct dependent on ongoing validation.

Scale and Scope

In small groups, such as a village or close-knit , common knowledge is relatively straightforward to establish through direct interpersonal interactions and strong ties, which facilitate the rapid dissemination of mutual and higher-order awareness among members. By contrast, in large-scale populations, such as a recognizing the of its leader like the U.S. , achieving common knowledge demands widespread mechanisms like , public announcements, or rituals to propagate information, yet confirming the full extent of shared understanding typically requires indirect methods like opinion surveys due to the impracticality of direct verification. A primary challenge in scaling common knowledge lies in the absence of reliable empirical instruments to assess its defining hierarchy—where not only does everyone know a fact, but everyone knows that everyone knows it, —leading researchers and practitioners to rely on approximations such as "widely known" propositions inferred from behaviors or events. This difficulty intensifies with group size, as privacy constraints and perceptual variances make even approximate common knowledge unattainable in diverse, expansive settings. The scope of common knowledge is further constrained by cultural, linguistic, and regional factors, which delimit the shared epistemic environment. For instance, historical events ingrained in one nation's collective and may constitute common knowledge there but fail to achieve the same status across international borders due to differing cultural narratives and informational access.

Common Belief Distinction

The distinction between common knowledge and common belief lies fundamentally in the requirement of truth and verifiability. Common knowledge of a demands not only that it be true but also that it is publicly known to all relevant parties at every iterative level of awareness—everyone knows it, everyone knows that everyone knows it, and so on indefinitely—ensuring a stable epistemic foundation for coordination. In contrast, common belief requires only widespread iterative acceptance without necessitating truth, allowing for shared convictions that may be false yet function socially in the short term. This weaker condition approximates common knowledge in practical scenarios, such as game-theoretic interactions, where infinite verifiability is unattainable but high-order beliefs suffice for approximate equilibrium. Epistemologically, the criteria for knowledge impose stricter conditions than for mere belief. Traditional analysis defines knowledge as justified true belief, a view challenged by Gettier cases where individuals hold justified beliefs that happen to be true but lack genuine understanding due to flawed reasoning or luck, thus failing as knowledge. Common knowledge extends this by requiring justification and truth across all levels of mutual awareness, preventing epistemic instability. Common belief, however, omits the truth condition, permitting justified but erroneous shared convictions; for instance, the widespread acceptance of a flat Earth in certain ancient societies represented common belief, as it was iteratively endorsed without veridical basis, eventually disproven by empirical evidence. These differences carry implications for social , where common beliefs can temporarily unify groups through aligned expectations and behaviors, fostering rituals or conventions based on acceptance alone. Yet, such cohesion is fragile, prone to disruption when falsity is exposed, leading to or realignment, whereas common knowledge provides enduring by grounding interactions in verifiable truth. Verifying truth across large-scale groups amplifies these challenges, often rendering full common knowledge elusive in diverse societies.

Illustrative Examples

Philosophical Puzzles

The muddy children puzzle exemplifies the counterintuitive nature of common knowledge in epistemic reasoning. In this scenario, n children play outside, and k of them (where 1 ≤ k ≤ n) return with mud on their foreheads, though none can see their own forehead but can observe the others. A father publicly announces that at least one child has mud on their forehead, making this fact common knowledge among the children, who are assumed to be perfectly rational and aware of each other's rationality. He then repeatedly asks the group if any child knows whether they have mud; in the first k-1 rounds, all respond "no," but on the kth round, the k muddy children simultaneously deduce their status and affirm it. This resolution occurs through iterative elimination: each child reasons about what others would do if fewer than k were muddy, with the public announcements and common knowledge of rationality enabling the infinite regress of higher-order beliefs required for the deduction. A closely related puzzle, the blue-eyed islanders, further illustrates how common knowledge facilitates infinite in group . Consider an island inhabited by 100 people with blue eyes and the rest with brown eyes, where all are logical reasoners who cannot discuss s and must leave the island at midnight if they ever deduce their own . A visiting guru publicly states that she sees at least one person with blue eyes, establishing common knowledge of this fact. Although no one leaves for 99 nights, on the 100th night, all 100 blue-eyed individuals depart simultaneously. Each blue-eyed islander sees 99 others with blue eyes and initially expects them to leave on the 99th night if their own eyes were brown; the failure to do so, combined with the common knowledge from the guru's announcement, allows the inductive chain to propagate, confirming their own eye color. These puzzles underscore the critical role of common knowledge in , revealing that it is indispensable for enabling coordinated, rational action among agents without additional private communication, in ways that mere mutual cannot achieve. The recursive structure of common knowledge—encompassing all levels of iterated —forms the foundation for the resolutions in such scenarios.

Everyday Instances

In , factual propositions such as "Paris is the capital of " serve as classic examples of common knowledge among educated populations worldwide, disseminated through formal schooling, textbooks, and global exposure. This shared understanding extends to basic geographical and historical facts, where individuals not only know the information but also recognize that others in their possess the same , often reinforced by repeated cultural references. Safety knowledge also exemplifies common knowledge in households, particularly warnings like the danger of mixing and , which produces toxic chloramine gas capable of causing respiratory distress and other health issues. campaigns, product labels, and medical advisories have widely disseminated this information, making it a standard precaution in cleaning practices across many homes, where people know the risk and assume others do as well. Social norms, such as traffic rules requiring drivers to stop at red lights, illustrate common knowledge through an infinite chain of mutual : drivers know to stop, know that fellow drivers know to stop, and know that this is universally shared among road users, enabling coordinated without constant oversight. This recursive underpins compliance in daily , supported by , , and legal enforcement that reinforces collective understanding.

Applications

In Game Theory

In game theory, common knowledge plays a pivotal role in modeling strategic interactions, particularly in ensuring that players' beliefs about each other's rationality and information align to support outcomes. Epistemic game theory formalizes these interactions by representing players' beliefs as infinite hierarchies, where each level captures what a player believes about others' beliefs, and common knowledge requires agreement at every level of this hierarchy. Without common knowledge, even mutually beneficial coordination can fail, as illustrated in variants of coordination games akin to the . A seminal result highlighting the importance of common knowledge is Robert Aumann's 1976 agreement theorem, which states that if two rational Bayesian players share a common distribution and their posterior beliefs about an event are common knowledge—along with the information partitions generating those posteriors—then their posteriors must coincide. This theorem implies that rational players cannot "" when common knowledge holds, enabling predictable behavior in Bayesian updating scenarios and underscoring common knowledge as a foundation for in uncertain environments. In finite games of , —the process of solving for perfect equilibria by reasoning backwards from terminal nodes—relies crucially on common knowledge of among players. Specifically, for rational play to eliminate non-equilibrium paths, it must be common knowledge that all players are rational at every decision point, ensuring that no player would deviate from optimal strategies in any . Aumann formalized this in , proving that common knowledge of substantive rationality implies the solution, thereby linking epistemic assumptions directly to strategic predictions. These epistemic foundations reveal how common knowledge resolves potential coordination failures in strategic settings; for instance, in Rubinstein's 1989 electronic mail game—a coordination problem where players must jointly choose an action but receive iterative confirmations with a small failure probability—even a tiny risk of message loss prevents common knowledge from emerging, leading rational players to default to a safe, inefficient despite near-certainty of the better payoff. This example demonstrates that finite levels of mutual knowledge are insufficient for coordination, necessitating the infinite depth of common knowledge to sustain cooperation in dilemma-like structures.

In Law

In legal systems, the doctrine of allows courts to accept certain facts as true without requiring formal proof, particularly when those facts constitute common knowledge that is indisputable within the relevant . This streamlines proceedings by obviating the need for on matters everyone is presumed to know, such as basic geographical facts like the location of a country's capital or calendrical truths like the number of days in during a non-leap year. In the United States, this is codified in Federal of 201, which permits judicial notice of adjudicative facts not subject to reasonable dispute because they are generally known within the trial court's territorial or can be accurately determined from reliable sources. Common knowledge also intersects with hearsay rules, where exceptions may permit testimony or statements about publicly known facts without , as these are deemed inherently reliable due to their widespread acceptance. For instance, in the U.S., often supplants potential hearsay by establishing facts outright, avoiding the need for out-of-court statements. In the , under the , preserved common law exceptions to the hearsay rule include public information—such as official records of notorious events—that can serve as evidence of the facts stated, provided they align with common knowledge standards. These provisions vary by jurisdiction: U.S. rules emphasize codified evidentiary thresholds, while approaches rely more on statutory and flexibility, ensuring that only universally acknowledged facts bypass traditional proof requirements. However, the application of common knowledge in has strict limitations to preserve fairness and the assumption that such facts are verifiably known beyond to all parties involved. Courts cannot take of controversial, specialized, or local facts that might be disputed or unknown outside narrow contexts, as this would undermine the doctrine's reliance on indisputability. For example, while a court might notice that boils at 100°C at , it would not accept a contested or community-specific custom without evidence. This boundary maintains the infinite regress of knowledge inherent in common knowledge—where the fact is not only known but known to be known by everyone in the jurisdiction—preventing misuse in adversarial settings.

In Computer Science

In , common knowledge plays a crucial role in ensuring that all nodes in a system agree on a single value or state despite potential failures, such as crashes or message losses, enabling coordinated action across unreliable networks. This concept, formalized through a hierarchy of levels—ranging from individual knowledge to infinite iterations of mutual knowledge—underpins protocols that achieve by making facts publicly verifiable at all levels. For instance, the algorithm, developed by , uses public announcements and majority quorums among acceptors to propagate proposals, thereby establishing eventual common knowledge of the chosen value and preventing conflicting decisions. Byzantine fault tolerance (BFT) extends this to scenarios where nodes may behave arbitrarily or maliciously, requiring common knowledge of the system state for reliable broadcast and agreement. Lamport's seminal 1982 work on the Byzantine Generals Problem demonstrates that achieving consensus among loyal nodes in the presence of up to one-third faulty (Byzantine) nodes necessitates oral or signed message protocols that ensure all loyal participants infer the same command through recursive majority voting and verification. These models highlight that without mechanisms approximating common knowledge—such as unforgeable signatures—coordinated actions like simultaneous attacks become impossible in asynchronous environments with unreliable communication. Post-2011 developments have applied common to emerging domains like and multi-agent systems. In , Bitcoin's proof-of-work consensus mechanism establishes eventual common knowledge of the ledger state by requiring miners to compete in solving computational puzzles, with the longest ensuring all participants publicly verify and agree on the transaction history despite potential forks or attacks. Similarly, in multi-agent systems, approaches like Multi-Agent Common Knowledge (MACKRL) enable decentralized coordination by learning hierarchical policy trees that exploit shared, infinite-level knowledge among agents, improving performance in tasks such as or . These applications leverage game-theoretic foundations to model agent rationality, ensuring robust shared awareness in scalable, fault-prone settings.

References

  1. [1]
    What Is Common Knowledge? | Episteme | Cambridge Core
    Jan 3, 2012 · Common knowledge is usually defined as a state in which everyone knows that p, everyone knows that everyone knows that p, and so on, ...
  2. [2]
    None
    ### Definition of Common Knowledge in Game Theory
  3. [3]
    Full article: Common Knowledge and Hinge Epistemology
    Mar 28, 2024 · This paper argues that the nature and utility of common knowledge can be illuminated by appeal to Wittgenstein's Hinge Epistemology.
  4. [4]
  5. [5]
    [PDF] Common Knowledge and Common Belief - CWI
    The philosopher. David Lewis treated traffic conventions in one of the first explicit treatments of common knowledge, in his book Convention [30]. To explain ...
  6. [6]
    [PDF] Who's afraid of common knowledge? - PhilArchive
    Feb 7, 2024 · Common knowledge is when everyone knows something, that everyone knows that everyone knows it, and so on. It's defined in terms of higher-order ...
  7. [7]
    Convention : a philosophical study : Lewis, David K. (David Kellogg ...
    Jan 14, 2022 · Lewis analyzes social conventions as regularities in the resolution of recurring coordination problems-situations characterized by interdependent decision ...
  8. [8]
    The Strategy of Conflict - Harvard University Press
    Thomas Schelling's book The Strategy of Conflict set forth his vision of game theory as a unifying framework for the social sciences.
  9. [9]
    Common Knowledge - Stanford Encyclopedia of Philosophy
    Aug 28, 2001 · Common knowledge is a phenomenon which underwrites much of social life. In order to communicate or otherwise coordinate their behavior ...Alternative Accounts of... · Applications of Mutual and... · Strategic Form Games
  10. [10]
    Geocentric model: The Earth-centered view of the universe | Space
    Dec 17, 2021 · The geocentric model is a debunked theory that the Earth is the center of the universe, with the sun and planets revolving around it.
  11. [11]
  12. [12]
  13. [13]
  14. [14]
    Approximating common knowledge with common beliefs
    It is shown that common knowledge can be approximated by the weaker and more easily obtained condition of common belief.
  15. [15]
    [PDF] analysis 23.6 june 1963 - is justified true belief knowledge?
    IS JUSTIFIED TRUE BELIEF KNOWLEDGE? By EDMUND L. GETTIER. V ARIOUS attempts have been made in recent years to state necessary and sufficient conditions for ...Missing: primary source
  16. [16]
    Flat wrong: the misunderstood history of flat Earth theories
    Jan 28, 2016 · ... common belief that most people in medieval times believed the Earth was flat. How unenlightened they were. But, if the flat Earth serves as a ...<|control11|><|separator|>
  17. [17]
    How to Safely Clean and Sanitize with Bleach | Natural Disasters
    Feb 9, 2024 · Never mix bleach with ammonia or any other cleaner. Wear rubber or other non-porous boots, gloves, and eye protection. Try not to breathe in ...
  18. [18]
    Household Cleaners | Children's Hospital of Philadelphia
    A common house-cleaning mistake is combining ammonia with bleach. This combination results in an irritating fume called chloramine gas.
  19. [19]
    [PDF] Traffic safety and norms of compliance with rules: An exploratory study
    May 23, 2022 · Let us assume that interactions occur in situations where a norm of behavior toward a rule. Page 6. exists and is common knowledge. Such ...<|control11|><|separator|>
  20. [20]
    [PDF] The Electronic Mail Game - Ariel Rubinstein
    Two players have to play one of two possible coordination games. Only one of them receives information about the coordination game to be played. It is shown ...
  21. [21]
    Agreeing to Disagree - Project Euclid
    November, 1976 Agreeing to Disagree. Robert J. Aumann · DOWNLOAD PDF + SAVE TO MY LIBRARY. Ann. Statist. 4(6): 1236-1239 (November, 1976). DOI: 10.1214/aos ...
  22. [22]
    Rule 201. Judicial Notice of Adjudicative Facts - Law.Cornell.Edu
    (a) Scope. This rule governs judicial notice of an adjudicative fact only, not a legislative fact. (b) Kinds of Facts That May Be Judicially Noticed.
  23. [23]
    Judicial Notice: An Underappreciated and Misapplied Tool of ...
    Federal Rule of Evidence 201 allows courts to take judicial notice of adjudicative facts that are “not subject to reasonable dispute” because they are “ ...
  24. [24]
    Rule 803. Exceptions to the Rule Against Hearsay - Law.Cornell.Edu
    The present rule proceeds upon the theory that under appropriate circumstances a hearsay statement may possess circumstantial guarantees of trustworthiness ...
  25. [25]
    Criminal Justice Act 2003 - Legislation.gov.uk
    Hearsay, a statement not made in oral evidence, is admissible if a law allows it, all parties agree, or the court deems it in the interest of justice.
  26. [26]
    Hearsay | The Crown Prosecution Service
    Sep 10, 2021 · Exceptions to the rule against Hearsay. Section 114(1) CJA 2003 provides four circumstances in which hearsay evidence is admissible in criminal ...
  27. [27]
    Knowledge and common knowledge in a distributed environment
    In particular, distributed knowledge corresponds to knowledge that is “distributed” among the members of the group, while common knowledge corresponds to a fact ...
  28. [28]
    [PDF] Knowledge and common knowledge in a distributed environment
    This paper presents a general framework for formalizing and reasoning about knowledge in distributed systems. It is shown that states of knowledge of groups of ...
  29. [29]
    [PDF] Paxos Made Simple - Leslie Lamport
    Nov 1, 2001 · We let the three roles in the consensus algorithm be performed by three classes of agents: proposers, acceptors, and learners. In an ...
  30. [30]
    [PDF] The Byzantine Generals Problem - Leslie Lamport
    Reliable computer systems must handle malfunctioning components that give conflicting information to different parts of the system.
  31. [31]
    Multi-Agent Common Knowledge Reinforcement Learning - arXiv
    Oct 27, 2018 · MACKRL uses common knowledge between agents to enable complex decentralized coordination, using a hierarchical policy tree. It learns a policy ...Missing: 2011 | Show results with:2011