Skip to main content
Log in

The Fragility of Common Knowledge

  • Original Research
  • Published:
Erkenntnis Aims and scope Submit manuscript

Abstract

Ordinary common knowledge is formally expressed by strong probabilistic common belief. How strong exactly? The question can be answered by drawing from the similar equivalence, recently explored, between plain and probabilistic individual beliefs. I argue that such a move entails that common knowledge displays a double fragility: as a description of a collective state and as a phenomenon, because it can respectively disappear as group size increases, or more worryingly as the epistemic context changes. I argue that despite this latter fragility, the effects of common knowledge on action are robust. Unfortunately, this in turn leads to a third fragility, that of the concept of common knowledge, which threatens to collapse on probabilistic common belief. This also reveals a disanalogy between the individual and the collective cases. I finally pinpoint the subtle difference entailed by the two concepts, expressed in terms of the attitude towards contrary evidence or of the agents’ awareness. As a result, common knowledge can be defended as a concept, which refers to a fragile yet distinct collective attitude.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Notes

  1. Or after multiple typical events have taken place, such as when several agents have been exposed to similar sources of information. This is the basis for common knowledge based on what is called a distributed indicator’ for Cubitt and Sugden (2003:191), or equivalently for indirect common knowledge for Paternotte (2011). The distinction between public and typical event-based common knowledge will not matter here—although I will later appeal to the fact that much common knowledge is indirect.

  2. There were earlier attempts to rediscover, refine or replace Lewis’ version, although non formally; see for instance Sperber and Wilson (1986) and Gilbert (1989).

  3. See for instance Fagin et al. (1995). For now we can do without any formal apparatus though.

  4. In particular, the question of the relation between common knowledge and common belief does not hinge on a particular concept of knowledge, and is independent from the debate concerning the links between individual knowledge and belief.

  5. Due to Lewis (1969). Arguments for its renewed relevance have been given by Cubitt and Sugden (2003), Sillari (2005) and Paternotte (2011).

  6. So p-common belief is just partial common belief for a given strength of belief p.

  7. Belief operators need not refer to beliefs. For instance, Paternotte (2011) uses them to formally express Lewis’ notions of “having reason to believe” and of indication. Even alternative frameworks of Lewis’ concept of common knowledge, such as Cubitt and Sugden’s (2003), are based on an individual epistemic operators.

  8. Note that some do not accept that plain belief be closed under conjunction or even deduction; see for instance Kyburg (1970), Christensen (2004) and Easwaran and Fitelson (2015).

  9. If this does not strike you, think of a lottery with a million tickets, as in Leitgeb’s example.

  10. Where this equivalence is understood according to the Lockean thesis introduced earlier, rather than to the Humean thesis on belief, which states that “it is rational to believe a proposition just in case it is rational to have a stably high degree of belief in it.” (Leitgeb 2014:145, fn. 9). The Humean thesis involves stability, but not the Lockean one.

  11. Note that any threshold strictly greater than \(\frac{999}{1000}\) could still be chosen here. As a result, the only stable set would be that of all worlds—all the agent would plainly believe is that one of the tickets is a winning one.

  12. Another use of Leitgeb’s account in the context of social epistemology—although on the topic of judgment aggregation—can be found in Cariani (2016).

  13. This characterization of common knowledge in terms of reachable possible worlds harks back to Aumann’s (1976) seminal formalisation of common knowledge.

  14. One may think that agents face a similar problem arises concerning the attribution of underlying probability distributions by others to them–that it is hard for agent A to determine what agent B may think A’s probability distribution over a set of worlds inconsistent with A’s current knowledge is. I do no think this is a strong issue though. This is because Leitgebs as well as traditional epistemic models presuppose a unique underlying probability distribution defined on all possible worlds. So when an agent reflects a set of possible worlds that are inconsistent with her current knowledge (an element E of her epistemic partition that does not contain the actual world), she can in principle infer what her subjective probability distribution would be by conditionalising the general probability distribution on the occurrence of E.

  15. This is a non-technical term, expressing the common knowledge of parameters of the situation that are typically assumed but not formally expressible, such as of the underlying probability distribution or of each agent’s epistemic partitions.

  16. Such similarity may be seen as a presupposition that all share the same “inductive standards” (Lewis 1969), that is (in our vocabulary), draw the same beliefs from a similar epistemic context because they assume they share their awareness contexts. This parallel with inductive standards is justified if one sees Leitgeb’s framework as a way to recover the “inductive link from partial reasons to full reasons”, which Paternotte (2011) claims is needed to fully work out the degrees for which partial common belief may constitute common knowledge.

  17. Each agent believes that the other s-believes that the actual world obtains with a degree \(s'\) slightly greater than s—as it is possible that both mistakenly heard a non-existent siren. But \(s'\)-belief implies s-belief.

  18. For instance, for \(p=0.5\), \(q=0.9\) and r = 0.99, ordinary common knowledge is impossible among more than eight agents.

  19. Note that this does not mean that the phenomenon of common knowledge is fragile, that is, that common knowledge dissipates easily; but that the appearance of common knowledge from a given public event is not robust with respect to certain changes of the number of witnesses.

  20. Because the messages are sent successively, m can only be equal to n or to \(n+1\), as the first agent sent the first message.

  21. Although this would not be classical common knowledge of P, which can be defined iteratively as: all agents know that all know...that all know P. Here, we have a different iterative definition, saying that agent 1 knows that agent 2 knows that...that agent 1 knows P (as well as the same proposition in which 1 and 2 are inverted). These two definitions are equivalent in the case of knowledge if based on certain belief, but not on partial belief (See Morris 1999 for more details about the divergence between various definitions of common partial belief that coincide for certain belief).

  22. Note that there is a difference with Leitgeb’s solution. For Leitgeb, changes in awareness happen with a fixed set of possible worlds: what an agent is aware of does not impinge on what she deems possible. In our solution to the coordinated attack problem, agents can be aware of worlds they deem impossible: if an agent has received 30 messages, she knows that she has not received 31, let alone an infinity. Still, the agents’ interactive set of possible worlds stays unchanged—that is, the set of worlds such that it is possible for an agent that it is possible for another that... that the world is possible for an agent. In interactive epistemic situations, agents have to consider impossibilities that others deem possible.

  23. In particular, certain coarsenings of partitions leave plain beliefs unchanged; partition refinements are what typically result in belief loss. For a detailed discussion, see Leitgeb (2014:155–160).

  24. By this, I mean the definition sought in this paper, based on the partial common belief plus a way to obtain plain from partial common belief, that is, based on a classical epistemic framework supplemented by Leitgeb’s.

  25. Here and earlier, I am indebted to an anonymous referee, who stressed the need for clarifications regarding Barwise’s three fundamental questions.

  26. More specifically, common knowledge guarantees agree to disagree results, iterated deletion of dominated strategies in games and convergence on a Pareto-dominant outcome by best response dynamics in a coordination problem.

  27. Of course, this strategy is impossible in the coordinated attack problem, in which there is no public event to be repeated or multiplied.

  28. Still, note that pluralism, if common, is not universal. See Lyon (ms.) for a recent criticism of pluralism with respect to plain and partial beliefs.

  29. Note that this does not contradict the claim that there can be ordinary common knowledge in the coordinated attack problem although it features no public event. The definition does not exclude a other possible sources for common knowledge.

  30. Kinds of salience-history-based common knowledge that Lewis (1969) already discussed in his truly seminal work.

  31. Here, priority and posterity are to be understood conceptually rather than temporally.

  32. See Schipper (2014) for a short survey.

  33. More precisely, agents are aware or unaware of propositions—worlds are included or excluded from a subjective state space depending on which propositions are expressible in them.

References

  • Aumann, R. J. (1976). Agreeing to disagree. The Annals of Statistics, 4(6), 1236–1239.

    Article  Google Scholar 

  • Barwise, J. (1988). Three views of common knowledge. In M. Y. Vardi (Ed.), Proceedings of the 2nd Conference on Theoretical Aspects of Reasoning About Knowledge (pp. 365–379). San Francisco: Kaufmann Publihers Inc.

  • Cariani, F. (2016). Local supermajorities. Erkenntnis, 81, 391–406.

    Article  Google Scholar 

  • Christensen, D. (2004). Putting logic in its place. Oxford: Oxford University Press.

    Book  Google Scholar 

  • Cubitt, R., & Sugden, R. (2003). Common knowledge, salience and convention: A reconstruction of David Lewis’s game theory. Economics and Philosophy, 19, 175–210.

    Article  Google Scholar 

  • Easwaran, K., & Fitelson, B. (2015). Accuracy, coherence and evidence. In T. S. Gendler & J. Hawthorne (Eds.), Oxford studies in epistemology (Vol. 5). Oxford: Oxford University Press.

  • Fagin, R., Halpern, J. Y., Moses, Y., & Vardi, M. Y. (1995). Reasoning about knowledge. Cambridge: MIT Press.

    Google Scholar 

  • Foley, R. (1993). Working without a net. Oxford: Oxford University Press.

  • Frankish, K. (2009). Partial belief and flat-out belief. In F. Huber & C. Schmidt-Petri (Eds.), Degrees of belief (pp. 75–93). Dordrecht: Springer.

    Chapter  Google Scholar 

  • Gilbert, M. (1989). On social facts. Princeton: Princeton University Press.

    Google Scholar 

  • Harman, G. (1986). Change in view: Principles of reasoning. Cambridge: MIT Press.

    Google Scholar 

  • Heifetz, A., Meier, M., & Schipper, B. C. (2006). Interactive unawareness. Journal of Economic Theory, 130, 78–94.

    Article  Google Scholar 

  • Kyburg, H. E. (1970). Conjunctivitis. In M. Swain (Ed.), Induction, acceptance and rational belief (pp. 55–82). Dordrecht: Reidel.

    Chapter  Google Scholar 

  • Lewis, D. (1969). Convention—A philosophical study. Cambridge: Harvard University Press.

    Google Scholar 

  • Leitgeb, H. (2014). The stability theory of belief. Philosophical Review, 123(2), 131–171.

    Article  Google Scholar 

  • Lyon, A. Resisting Doxastic Pluralism: The Bayesian Challenge Redux. Manuscript.

  • Morris, S. (1999). Approximate common knowledge revisited. International Journal of Game Theory, 23, 385–408.

    Article  Google Scholar 

  • Monderer, D., & Samet, D. (1989). Approximating common knowledge with common beliefs. Games and Economic Behavior, 1, 170–190.

    Article  Google Scholar 

  • Morris, S., & Shin, H. S. (1997). Approximate common knowledge and co-ordination: Recent lessons from game theory. Journal of Language, Logic and Information, 6, 171–190.

    Article  Google Scholar 

  • Paternotte, C. (2011). Being realistic about common knowledge: A Lewisian approach. Synthese, 183(2), 249–276.

    Article  Google Scholar 

  • Schipper, B. (2014). Unawareness – a gentle introduction to both the literature and the special issue. Mathematical Social Sciences, 70, 1–9.

  • Sillari, G. (2005). A logical framework for convention. Synthese, 147, 379–400.

    Article  Google Scholar 

  • Sperber, D., & Wilson, D. (1986). Relevance: Communication and cognition. Oxford: Blackwell.

    Google Scholar 

Download references

Acknowledgments

I thank the audience of the Salzburg Social epistemology Workshop (September 2014) for insightful questions and comments, as well as two very helpful anonymous referees. This work was supported by the Alexander von Humboldt Foundation.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Cédric Paternotte.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Paternotte, C. The Fragility of Common Knowledge. Erkenn 82, 451–472 (2017). https://doi.org/10.1007/s10670-016-9828-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10670-016-9828-4

Keywords

Navigation