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

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

Spatial evolutionary games model individuals who are distributed in a spatial domain and update their strategies upon playing a normal form game with their neighbors. We derive integro-differential equations as deterministic approximations of the microscopic updating stochastic processes. This...

The paper discusses community enforcement in infinitely repeated, two-action games with local interaction and uncertain monitoring. Each player interacts with and observes only a fixed set of opponents, of whom he is privately informed. The main result shows that when beliefs about the...

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

We study games endowed with a pre-play phase in which players prepare the actions that will be implemented at a predetermined deadline. In the preparation phase, each player stochastically receives opportunities to revise her actions, and the finally-revised action is taken at the deadline. In...

Abstract. We analyze discounted repeated games with incomplete information, such that the players' payoffs depend only on their own type (known-own payoff case). We describe an algorithm for finding all equilibrium payoffs in games for which there exists an open set of belief-free equilibria of...

This paper studies an infinite horizon repeated moral hazard problem where a single principal employs several agents. We assume that the principal cannot observe the agents' effort choices; however, agents can observe each other and can be contractually required to make observation reports to...

A key obstacle to coordination and cooperation in many networked environments is that behavior in each bilateral relationship is not observable to individuals outside that relationship: that is, information is local. This paper investigates when players can use communication to replicate any...