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 payoff types are strategically distinguishable if and...

A game of incomplete information can be decomposed into a basic game and an information structure. The basic game defines the set of actions, the set of payoff states the payoff functions and the common prior over the payoff states. The information structure refers to the signals that the...

We characterize revenue maximizing mechanisms in a common value environment where the value of the object is equal to the highest of the bidders' independent signals. If the revenue maximizing solution is to sell the object with probability 1, then an optimal mechanism is simply a posted price,...

A game of incomplete information can be decomposed into a basic game and an information structure. The basic game defines the set of actions, the set of payoff states the payoff functions and the common prior over the payoff states. The information structure refers to the signals that the...

We characterize revenue maximizing mechanisms in a common value environment where the value of the object is equal to the highest of bidders’ independent signals. If the object is optimally sold with probability one, then the optimal mechanism is simply a posted price, with the highest...

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 payoff types are strategically distinguishable if and...

We study a principal–agent model. The parties are symmetrically informed at first; the principal then designs the process by which the agent learns his type and, concurrently, the screening mechanism. Because the agent can opt out of the mechanism ex post, it must leave him with nonnegative...

We study a principal--agent model. The parties are symmetrically informed at first; the principal then designs the process by which the agent learns his type and, concurrently, the screening mechanism. Because the agent can opt out of the mechanism ex post, it must leave him with nonnegative...

A single seller faces a sequence of buyers with unit demand. The buyers are forward-looking and long-lived. Each buyer has private information about his arrival time and valuation where the latter evolves according to a geometric Brownian motion. Any incentive-compatible mechanism has to induce...

We define and analyze a "strategic topology'' on types in the Harsanyi-Mertens-Zamir universal type space, where two types are close if their strategic behavior is similar in all strategic situations. For a fixed game and action define the distance between a pair of types as the difference...