A learning rule is uncoupled if a player does not condition his strategy on the opponent's payoffs. It is radically uncoupled if a player does not condition his strategy on the opponent's actions or payoffs. We demonstrate a family of simple, radically uncoupled learning rules whose...

This paper introduces a mechanism design approach that allows dealing with the multiple equilibrium problem, using mechanisms that are robust to bounded rationality. This approach is a tool for constructing supermodular mechanisms, i.e. mechanisms that induce games with strategic...

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...

We call a correspondence, defined on the set of mixed strategy pro les, a generalized best reply correspondence if it (1) has a product structure, (2) is upper hemi-continuous, (3) always includes a best reply to any mixed strategy pro le, and (4) is convex- and closed-valued. For each...

We develop a model of information exchange through communication and investigate its implications for information aggregation in large societies. An \textit{underlying state} determines payoffs from different actions. Agents decide which others to form a costly \textit{communication link} with,...

We develop a dynamic framework of strategic information transmission through cheap talk in a social network. Privately informed agents have different preferences about the action to be implemented by each agent and repeatedly communicate with their neighbors in the network. We first characterize...

We consider dynamic team production in the presence of uncertainty. Team members receive interim feedback that depends on both their current effort level and the project's uncertain prospects. In this environment, each member can encourage the others by making them more optimistic about the...

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...

We call a correspondence, defined on the set of mixed strategy proles, a generalized best reply correspondence if it (1) has a product structure, (2) is upper hemi-continuous, (3) always includes a best reply to any mixed strategy prole, and (4) is convex- and closed-valued. For each generalized...

A learning rule is uncoupled if a player does not condition his strategy on the opponent's payoffs. It is radically uncoupled if a player does not condition his strategy on the opponent's actions or payoffs. We demonstrate a family of simple, radically uncoupled learning rules whose...