Previous research has established that the predictions made by game theory about strategic behavior in incomplete information games are quite sensitive to the assumptions made about the players' infinite hierarchies of beliefs. We evaluate the severity of this robustness problem by...

We consider abstract exchange mechanisms wherein individuals submit "diversified" offers in m commodities, which are then redistributed to them. Our first result is that if the mechanism satisfies certain natural conditions embodying "fairness" and "convenience" then it admits unique prices, in...

We consider mechanisms that provide traders the opportunity to exchange commodity i for commodity j, for certain ordered pairs ij. Given any connected graph G of opportunities, we show that there is a unique mechanism M_G that satisfies some natural conditions of "fairness" and "convenience."...

Consider agents who undertake costly effort to produce stochastic outputs observable by a principal. The principal can award a prize deterministically to the agent with the highest output, or to all of them with probabilities that are proportional to their outputs. We show that, if there is...

We study the robustness of interim correlated rationalizability to perturbations of higher-order beliefs. We introduce a new metric topology on the universal type space, called uniform weak topology, under which two types are close if they have similar first-order beliefs, attach similar...

We study the intergenerational accumulation of knowledge in an infinite-horizon model of communication. Each in a sequence of players receives an informative but imperfect signal of the once-and-for-all realization of an unobserved state. The state affects all players' preferences over present...

A feasible social state is irreducible if and only if, for any non-trivial partition of individuals with two groups, there exists another feasible social state at which every individual in the first group is equally well-off and someone strictly better-off. Competitive equilibria decentralize...

The set of possible outcomes of a strongly ordinal bimatrix game is studied by imbedding each pair of possible payoffs as a point on the standard two-dimensional integral lattice. In particular, we count the number of different Pareto optimal sets of each cardinality; we establish asymptotic...

This paper introduces generalized potential functions of complete information games and studies the robustness of sets of equilibria to incomplete information. A set of equilibria of a complete information game is robust if every incomplete information game where payoffs are almost always given...

Two approaches have been proposed in the literature to refine the rationalizability solution concept: either assuming that players make small errors when playing their strategies, or assuming that there is a small amount of payoff uncertainty. We show that both approaches lead to the same...