Some people commonly know a proposition just in case they all know it, they all know that they all know it, they all know that they all know that they all know it, and so on. They commonly believe a proposition just in case they all believe it, they all believe that they all believe it, they all believe that they all believe that they all believe it, and so on. A long tradition in economic theory, theoretical computer science, linguistics (...) and philosophy has held that people have some approximation of common knowledge or common belief in a range of circumstances, for example, when they are looking at an object together, or when they have just discussed something explicitly in conversation. In this paper, I argue that people do not have any approximation of common knowledge or common belief in these circumstances. The argument suggests that people never have any approximation of common knowledge or common belief. (shrink)

The coordinated attack scenario and the electronic mail game are two paradoxes of common knowledge. In simple mathematical models of these scenarios, the agents represented by the models can coordinate only if they have common knowledge that they will. As a result, the models predict that the agents will not coordinate in situations where it would be rational to coordinate. I argue that we should resolve this conflict between the models and facts about what it would be rational to do (...) by rejecting common knowledge assumptions implicit in the models. I focus on the assumption that the agents have common knowledge that they are rational, and provide models to show that denying this assumption suffices for a resolution of the paradoxes. I describe how my resolution of the paradoxes fits into a general story about the relationship between rationality in situations involving a single agent and rationality in situations involving many agents. (shrink)

Justification logics are epistemic logics that explicitly include justifications for the agents' knowledge. We develop a multi-agent justification logic with evidence terms for individual agents as well as for common knowledge. We define a Kripke-style semantics that is similar to Fitting's semantics for the Logic of Proofs LP. We show the soundness, completeness, and finite model property of our multi-agent justification logic with respect to this Kripke-style semantics. We demonstrate that our logic is a conservative extension of Yavorskaya's minimal bimodal (...) explicit evidence logic, which is a two-agent version of LP. We discuss the relationship of our logic to the multi-agent modal logic S4 with common knowledge. Finally, we give a brief analysis of the coordinated attack problem in the newly developed language of our logic. (shrink)

The importance of the notion of common knowledge in sustaining cooperative outcomes in strategic situations is well appreciated. However, the systematic analysis of the extent to which small departures from common knowledge affect equilibrium in games has only recently been attempted.We review the main themes in this literature, in particular, the notion of common p-belief. We outline both the analytical issues raised, and the potential applicability of such ideas to game theory, computer science and the philosophy of language.

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. (shrink)

The importance of the notion of common knowledge in sustaining cooperative outcomes in strategic situations is well appreciated. However, the systematic analysis of the extent to which small departures from common knowledge affect equilibrium in games has only recently been attempted.We review the main themes in this literature, in particular, the notion of common p-belief. We outline both the analytical issues raised, and the potential applicability of such ideas to game theory, computer science and the philosophy of language.

The use of circumscription for formalizing commonsense knowledge and reasoning requires that a circumscription policy be selected for each particular application: we should specify which predicates are circumscribed, which predicates and functions are allowed to vary, and what priorities between the circumscribed predicates are established. The circumscription policy is usually described either informally or using suitable metamathematical notation. In this paper we propose a simple and general formalism which permits describing circumscription policies by axioms, included in the knowledge base along (...) with the axioms describing the objects of reasoning. The new formalism is illustrated by recasting some of the familiar applications of circumscription in its terms. (shrink)