The Common Prior Assumption (CPA) plays an important role in game theory and the economics of information. It is the basic assumption behind decision-theoretic justifications of equilibrium reasoning in games (Aumann, 1987, Aumann and Brandenburger, 1995) and no-trade results with asymmetric information (Milgrom and Stokey, 1982). Recently several authors (Dekel and Gul, 1997, Gul, 1996, Lipman, 1995) have questioned whether the CPA is meaningful in situations of incomplete information, where there is no ex ante stage and where the primitives of (...) the model are the individuals' beliefs about the external world (their first-order beliefs), their beliefs about the other individuals' beliefs (second-order beliefs), etc., i.e. their hierarchies of beliefs. In this context, the CPA is a mathematical property whose conceptual content is not clear. The main results of this paper (Theorems 1 and 2) provide a characterization of Harsanyi consistency in terms of properties of the belief hierarchies that are entirely unrelated to the idea of an ex ante stage. (shrink)

This paper contributes to a theory of rational choice for decision-makers with incomplete preferences due to partial ignorance, whose beliefs are representable as sets of acceptable priors. We focus on the limiting case of `Complete Ignorance' which can be viewed as reduced form of the general case of partial ignorance. Rationality is conceptualized in terms of a `Principle of Preference-Basedness', according to which rational choice should be isomorphic to asserted preference. The main result characterizes axiomatically a new choice-rule called `Simultaneous (...) Expected Utility Maximization'. It can be interpreted as agreement in a bargaining game (Kalai-Smorodinsky solution) whose players correspond to the (extremal) `acceptable priors' among which the decision maker has suspended judgment. An essential but non-standard feature of Simultaneous Expected Utility choices is their dependence on the entire choice set. This is justified by the conception of optimality as compromise rather than as superiority in pairwise comparisons. (shrink)

Counterexamples to two results by Stalnaker (Theory and Decision, 1994) are given and a corrected version of one of the two results is proved. Stalnaker's proposed results are: (1) if at the true state of an epistemic model of a perfect information game there is common belief in the rationality of every player and common belief that no player has false beliefs (he calls this joint condition ‘strong rationalizability’), then the true (or actual) strategy profile is path equivalent to a (...) Nash equilibrium; (2) in a normal-form game a strategy profile is strongly rationalizable if and only if it belongs to C8 , the set of profiles that survive the iterative deletion of inferior profiles. (shrink)