Within an incomplete information framework (where the primitives are the individuals' belief hierarchies) we investigate the intersubjective implications of the assumption that it is common belief that no individual has any false beliefs (a key component of the Truth Axiom). We consider two...

The logic of common belief does not always reflect the logic of individual beliefs. In particular, the Negative Introspection property fails at the common belief level, that is, it can happen that neither is A commonly believed nor is it common belief that A is not commonly believed. Indeed...

We provide an introduction to interactive belief systems from a qualitative and semantic point of view. Properties of belief hierarchies are formulated locally. Among the properties considered are "Common belief in no error" (which has been shown to have important game theoretic applications),...

This paper raises the problem of how to define revealed probabilistic beliefs in the context of the capacity/Choquet Expected Utility model. At the center of the analysis is a decision-theoretically axiomatized definition of "revealed unambiguous events." The definition is shown to impose...

The main result of this paper characterizes possibly non-symmetric strategy-proof and efficienct choice functions as Perfectly Competitive. Efficiency is defined as impossibility of improvement by reallocation of commodity among finite sets of agents, and largeness of the economy is captured by...

Experimental studies have shown that trust and reciprocity are effective in increasing efficiency when complete contracting is infeasible. One example is the study by Berg et al. (1995) of the investment game. In this game the person who receives the investment is the one who may reward the...

This paper attempts to provide a unified account of the rationalization of possibly non-binary choice-functions by "Extended Preference Relations" (relations between sets and elements). The analysis focuses on transitive EPRs for which three choice-functional characterizations are given, two of...

We consider situations in which a group takes a collective decision by aggregating individual’s judgments on a set of criteria according to some agreed-upon decision functions. Assuming the criteria and the decision to be binary, we demonstrate that, except when the aggregation rule is...

We show that Maskin monotone social choice correspondences on sufficiently rich domains satisfy a generalized strategy-proofness property, thus generalizing Muller and Satterthwaite's (1977) theorem to correspondences. The result is interpreted as a possibility theorem on the dominant-strategy...