Consider repeated two-player games with perfect monitoring and discounting. We provide an algorithm that computes the set V* of payoff pairs of all pure-strategy subgame perfect equilibria with public randomization. The algorithm provides significant efficiency gains over the existing...

Predictions under common knowledge of payoffs may differ from those under arbitrarily, but finitely, many orders of mutual knowledge; Rubinstein's (1989)Email game is a seminal example. Weinstein and Yildiz (2007) showed that the discontinuity in the example generalizes: for all types with...

This paper investigates rationalizable implementation of social choice functions (SCFs) in incomplete information environments. We identify weak interim rationalizable monotonicity (weak IRM) as a novel condition and show that weak IRM is a necessary and almost sufficient condition for...

A speaker attempts to persuade a listener to accept a request by presenting evidence. A persuasion rule specifies what evidence is persuasive. This paper compares static and dynamic rules. We present a single linear program (i) whose solution corresponds to the listener's optimal dynamic rule...

We introduce a learning framework in which a principal seeks to determine the ability of a strategic agent. The principal assigns a test consisting of a finite sequence of tasks. The test is adaptive: each task that is assigned can depend on the agent's past performance. The probability of...

We study a seller's optimal mechanism for maximizing revenue when a buyer may present evidence relevant to her value. We show that a condition very close to transparency of buyer segments is necessary and sufficient for the optimal mechanism to be deterministic--hence akin to classic third...