We study a receiver's learning problem of choosing an informative test in a signaling environment. Each test induces a signaling subgame. Thus, in addition to its direct effect on the receiver's information, a test has an indirect effect through the sender's signaling strategy. We show that the...

Some private-monitoring games, that is, games with no public histories, can have histories that are almost public. These games are the natural result of perturbing public monitoring games towards private monitoring. We explore the extent to which it is possible to coordinate continuation play in...

We analyze the extent to which efficient trade is possible in an ongoing relationship between impatient agents with hidden valuations (i.i.d. over time), restricting attention to equilibria that satisfy ex post incentive constraints in each period. With ex ante budget balance, efficient trade...

This paper studies a dynamic adjustment process in a large society of forward-looking agents where payoffs are given by a normal form supermodular game. The stationary states of the dynamics correspond to the Nash equilibria of the stage game. It is shown that if the stage game has a monotone...

A self-proclaimed expert uses past observations of a stochastic process to make probabilistic predictions about the process. An inspector applies a test function to the infinite sequence of predictions provided by the expert and the observed realization of the process in order to check the...

A population of agents recurrently plays a two-strategy population game. When an agent receives a revision opportunity, he chooses a new strategy using a noisy best response rule that satisfies mild regularity conditions; best response with mutations, logit choice, and probit choice are all...

This paper extends the framework of Kajii and Morris (1997) to study the question of robustness to incomplete information in repeated games. We show that dynamically robust equilibria can be characterized using a one-shot robustness principle that extends the one-shot deviation principle. Using...

We prove that any deterministic evolutionary dynamic satisfying four mild requirements fails to eliminate strictly dominated strategies in some games. We also show that existing elimination results for evolutionary dynamics are not robust to small changes in the specifications of the dynamics....

We study the design of mechanisms that implement Lindahl or Walrasian allocations and whose Nash equilibria are dynamically stable for a wide class of adaptive dynamics. We argue that supermodularity is not a desirable stability criterion in this mechanism design context, focusing instead on...

Shimoji and Watson (1998) prove that a strategy of an extensive game is rationalizable in the sense of Pearce if and only if it survives the maximal elimination of conditionally dominated strategies. Briefly, this process iteratively eliminates conditionally dominated strategies according to a...