We consider Geanakoplos and Polemarchakis’s generalization of Aumman’s famous result on “agreeing to disagree", in the context of imprecise probability. The main purpose is to reveal a connection between the possibility of agreeing to disagree and the interesting and anomalous phenomenon known as dilation. We show that for two agents who share the same set of priors and update by conditioning on every prior, it is impossible to agree to disagree on the lower or upper probability of a hypothesis (...) unless a certain dilation occurs. With some common topological assumptions, the result entails that it is impossible to agree not to have the same set of posterior probabilities unless dilation is present. This result may be used to generate sufficient conditions for guaranteed full agreement in the generalized Aumman-setting for some important models of imprecise priors, and we illustrate the potential with an agreement result involving the density ratio classes. We also provide a formulation of our results in terms of “dilation-averse” agents who ignore information about the value of a dilating partition but otherwise update by full Bayesian conditioning. (shrink)

We represent consensus formation processes based on iterated opinion pooling as a dynamic approach to common knowledge of posteriors :1236–1239, 1976; Geanakoplos and Polemarchakis in J Econ Theory 28:192–200, 1982). We thus provide a concrete and plausible Bayesian rationalization of consensus through iterated pooling. The link clarifies the conditions under which iterated pooling can be rationalized from a Bayesian perspective, and offers an understanding of iterated pooling in terms of higher-order beliefs.

Since Kenneth Arrow showed the general possibility theorem, a number of social choice theorists have provided alternative proofs of it. In a recent article, Geanakoplos (Econ Theory 26:211–215, 2005) has constructed a new proof of the theorem. The present article provides alternative proofs of various Arrovian impossibility results from the 1960s to the 1970s by utilizing Geanakoplos’s method. We prove semi-order impossibility theorems, the quasi-transitive veto theorem, the quasi-transitive dictatorship theorem, the triple acyclic veto theorem, and the impossibility (...) theorem without the Pareto principle. (shrink)

We compare Colman's proposed “psychological game theory” with the existing literature on psychological games (Geanakoplos et al. 1989), in which beliefs and intentions assume a prominent role. We also discuss experimental evidence on intentions, with a particular emphasis on reciprocal behavior, as well as recent efforts to show that such behavior is consistent with social evolution.

Standard models in epistemic game theory make strong assumptions about agents’ knowledge of their own beliefs. Agents are typically assumed to be introspectively omniscient: if an agent believes an event with probability p, she is certain that she believes it with probability p. This paper investigates the extent to which this assumption can be relaxed while preserving some standard epistemic results. Geanakoplos (1989) claims to provide an Agreement Theorem using the “truth” axiom, together with the property of balancedness, a (...) significant relaxation of introspective omniscience. I provide an example which shows that Geanakoplos’s statement is incorrect. I then introduce a new property, local balancedness, which allows us both to correct Geanakoplos’s result, and to extend it to cases where the truth axiom may fail. I exploit this general Agreement Theorem to provide novel epistemic conditions for correlated and Nash equilibrium, both of which relax the assumption of introspective omniscience. In all three cases, the results are also extended to infinite state spaces. (This is Chapter 5 of my 2014 Oxford DPhil (PhD) thesis.). (shrink)