David Lewis is widely credited with the first formulation of common knowledge and the first rigorous analysis of convention. However, common knowledge and convention entered mainstream game theory only when they were formulated, later and independently, by other theorists. As a result, some of the most distinctive and valuable features of Lewis' game theory have been overlooked. We re-examine this theory by reconstructing key parts in a more formal way, extending it, and showing how it differs from more recent game (...) theory. In contrast to current theories of common knowledge, Lewis' theory is based on an explicit analysis of the modes of reasoning that are accessible to rational individuals and so can be used to analyse the genesis of common knowledge. Lewis' analysis of convention emphasises the role of inductive reasoning and of salience in the maintenance of conventions over time. Footnotes Earlier versions of this paper were presented at the 13th Amsterdam Colloquium at the University of Amsterdam, at a workshop on social norms at Wissenschaftskolleg zu Berlin, and at seminars at Tilburg University and the University of Bristol. We are grateful for comments from participants at those meetings, from two anonymous referees, and from Michael Bacharach, Nick Bardsley, Cristina Bicchieri, Luc Bovens, Simon Grant, David McCarthy, Shepley Orr, Brian Skyrms, Peter Vanderschraaf, Peter Wakker and Jörgen Weibull. Robert Sugden's work was supported by the Leverhulme Trust. (shrink)

We propose a modal logic based on three operators, representing intial beliefs, information and revised beliefs. Three simple axioms are used to provide a sound and complete axiomatization of the qualitative part of Bayes’ rule. Some theorems of this logic are derived concerning the interaction between current beliefs and future beliefs. Information flows and iterated revision are also discussed.

The notions of common knowledge or common belief play an important role in several areas of computer science , in philosophy, game theory, artificial intelligence, psychology and many other fields which deal with the interaction within a group of “agents”, agreement or coordinated actions. In the following we will present several deductive systems for common knowledge above epistemic logics –such as K, T, S4 and S5 –with a fixed number of agents. We focus on structural and proof-theoretic properties of these (...) calculi. (shrink)

In this paper we investigate first order common knowledge logics; i.e., modal epistemic logics based on first order logic with common knowledge operators. It is shown that even rather weak fragments of first order common knowledge logics are not recursively axiomatizable. This applies, for example, to fragments which allow to reason about names only; that is to say, fragments the first order part of which is based on constant symbols and the equality symbol only. Then formal properties of "quantifying into" (...) epistemic contexts are investigated. The results are illustrated by means of epistemic representations of Nash Equilibria for finite games with mixed strategies. (shrink)

There are two general classes of social conventions: conventions of coordination, and conventions of partial conflict. In coordination problems, the interests of the agents coincide, while in partial conflict problems, some agents stand to gain only if other agents unilaterally make certain sacrifices. Lewis' (1969) pathbreaking analysis of convention in terms of game theory focuses on coordination problems, and cannot accommodate partial conflict problems. In this paper, I propose a new game-theoretic definition of convention which generalizes previous game-theoretic definitions (Lewis (...) 1969, Vanderschraaf 1995), and which can be used to characterize norms of justice in partial conflict situations. I argue that the key structural property necessary for a social arrangement to be a convention is that it be conditionally self-enforcing, in the sense that: (i) each agent has a decisive reason to follow her end of the arrangement given that she expects all to do likewise, (ii) given a different set of expectations, some agents would have had a decisive reason to deviate, and (iii) these facts are common knowledge. This leads to a definition of convention as a strict correlated equilibrium (Aumann 1974) together with appropriate common knowledge conditions. Examples are given in which it is shown how this more general account of convention can be used to analyze norms of justice as well as coordination problems. It is only a general sense of common interest; which sense all the members of the society express to one another, and which induces them to regulate their conduct by certain rules. I observe, that it will be for my interest to leave another in the possession of his goods, provided he will act in the same manner with regard to me. He is sensible of a like interest in the regulation of his conduct. When this common sense of interest is mutually express'd, and is known to both, it produces a suitable resolution and behavior. And this may properly be call'd a convention or agreement betwixt us,.. (shrink)

Branching-time temporal logics have proved to be an extraordinarily successful tool in the formal specification and verification of distributed systems. Much of their success stems from the tractability of the model checking problem for the branching time logic CTL, which has made it possible to implement tools that allow designers to automatically verify that systems satisfy requirements expressed in CTL. Recently, CTL was generalised by Alur, Henzinger, and Kupferman in a logic known as Alternating-time Temporal Logic (ATL). The key insight (...) in ATL is that the path quantifiers of CTL could be replaced by cooperation modalities, of the form , where is a set of agents. The intended interpretation of an ATL formula is that the agents can cooperate to ensure that holds (equivalently, that have a winning strategy for ). In this paper, we extend ATL with knowledge modalities, of the kind made popular in the work of Fagin, Halpern, Moses, Vardi and colleagues. Combining these knowledge modalities with ATL, it becomes possible to express such properties as group can cooperate to bring about iff it is common knowledge in that . The resulting logic — Alternating-time Temporal Epistemic Logic (ATEL) — shares the tractability of model checking with its ATL parent, and is a succinct and expressive language for reasoning about game-like multiagent systems. (shrink)

Aconvention is a state in which agents coordinate their activity, not as the result of an explicit agreement, but because their expectations are aligned so that each individual believes that all will act so as to achieve coordination for mutual benefit. Since agents are said to follow a convention if they coordinate without explicit agreement, the notion raises fundamental questions: (1) Why do certain conventions remain stable over time?, and (2) How does a convention emerge in the first place? In (...) a pioneering study, Lewis (1969) addresses these questions by applyingnoncooperative game theory. Lewis defines a convention as aNash coordination equilibrium of a noncooperative game that issalient, that is, it is somehow conspicuous to the agents so that all expect one another to conform with the equilibrium. This paper presents a new game theoretic definition of conventions, which formalizes the notion of salience and which also generalizes the class of conventions Lewis discusses in his work. I define a convention as acorrelated equilibrium (Aumann 1974, 1987) satisfying apublic intentions criterion: Every agent wants his intended action to becommon knowledge. I argue that many conventions correspond to correlated equilibria that are not Nash equilibria, and that this is consistent with Lewis' general viewpoint. Finally, I argue that game theoretic characterizations of convention, such as Lewis' and my own, help to explain a convention's stability, but that a fully satisfactory account of the emergence of convention requires a theory of equilibrium selection beyond the scope of Lewis' work. (shrink)

_ Convention_ was immediately recognized as a major contribution to the subject and its significance has remained undiminished since its first publication in 1969. Lewis analyzes social conventions as regularities in the resolution of recurring coordination problems-situations characterized by interdependent decision processes in which common interests are at stake. Conventions are contrasted with other kinds of regularity, and conventions governing systems of communication are given special attention.

The purpose of this survey is twofold: (1) to place some centralthemes of epistemic logic in a general epistemological context,and (2) to outline a new framework for epistemic logic developedjointly with S. Andur Pedersen unifying some key ``mainstream''epistemological concerns with the ``formal'' epistemologicalapparatus.

This book offers original accounts of a number of central social phenomena, many of which have received little if any prior philosophical attention. These phenomena include social groups, group languages, acting together, collective belief, mutual recognition, and social convention. In the course of developing her analyses Gilbert discusses the work of Emile Durkheim, Georg Simmel, Max Weber, David Lewis, among others.

Analyzes the nature of international disagreements and conflict resolution in terms of game theory and non-zero-sum games.

Classic analysis of the subject and the development of personal probability; one of the greatest controversies in modern statistcal thought.

Reasoning About Knowledge is the first book to provide a general discussion of approaches to reasoning about knowledge and its applications to distributed ...

This book explores how individual actions coordinate to produce unintended social consequences. In the past this phenomenon has been explained as the outcome of rational, self-interested individual behaviour. Professor Bicchieri shows that this is in no way a satisfying explanation. She discusses how much knowledge is needed by agents in order to coordinate successfully. If the answer is unbounded knowledge, then a whole variety of paradoxes arise. If the answer is very little knowledge, then there seems hardly any possibility of (...) attaining coordination. The solution to coordination and cooperation is for agents to learn about each other. The author concludes that rationality must be supplemented by models of learning and by an evolutionary account of how social order can persist. (shrink)