A universal type space of interdependent expected utility preference types is constructed from higher-order preference hierarchies describing (i) an agent's (unconditional) preferences over a lottery space; (ii) the agent's preference over Anscombe-Aumann acts conditional on the unconditional...

We propose an incomplete information analogue of rationalizability. An action is said to be belief-free rationalizable if it survives the following iterated deletion process. At each stage, we delete actions for a type of a player that are not a best response to some conjecture that puts weight...

A universal type space of interdependent expected utility preference types is constructed from higher-order preference hierarchies describing (i) an agent's (unconditional) preferences over a lottery space; (ii) the agent's preference over Anscombe-Aumann acts conditional on the unconditional...

We identify a universal type space of possible interdependent (expected utility) preferences of a group of agents satisfying two criteria. First, a type consists of a "detail free" description, in a natural language, of the agents' interdependent preferences. Second, distinct types in the...

We study agents whose expected utility preferences are interdependent for informational or psychological reasons. We characterize when two types can be “strategically distinguished” in the sense that they are guaranteed to behave differently in some finite mechanism. We show that two types...

Consider the following "informational robustness" question: what can we say about the set of outcomes that may arise in equilibrium of a Bayesian game if players may observe some additional information? This set of outcomes will correspond to a solution concept that is weaker than equilibrium,...

Examples of repeated destructive behavior abound throughout the history of human societies. This paper examines the role of social memory -- a society's vicarious beliefs about the past -- in creating and perpetuating destructive conflicts. We examine whether such behavior is consistent with the...

We consider the implementation of social choice functions under complete information in rationalizable strategies. A strict (and thus stronger) version of the monotonicity condition introduced by Maskin (1999) is necessary under the solution concept of rationalizability. Assuming the social...

In a general interdependent preference environment, we characterize when two payoff types can be distinguished by their rationalizable strategic choices without any prior knowledge of their beliefs and higher order beliefs. We show that two types are strategically distinguishable if and only if...

We discuss four solution concepts for games with incomplete information. We show how each solution concept can be viewed as encoding informational robustness. For a given type space, we consider expansions of the type space that provide players with additional signals. We distinguish between...