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 present a new approach to studying equilibrium dynamics in a class of stochastic games with a continuum of players with private types and strategic complementarities. We introduce a suitable equilibrium concept, called Markov Stationary Nash Distributional Equilibrium (MSNDE), prove its...

We study impersonal exchange, and ask how agents can behave honestly in anonymous transactions without contracts. We analyze repeated anonymous random matching games, where agents observe only their own transactions. Little is known about cooperation in this setting beyond the prisoner's...

This paper aims to solve two fundamental problems on finite or infinite horizon dynamic games with complete information. Under some mild conditions, we prove the existence of subgame-perfect equilibria and the upper hemicontinuity of equilibrium payoffs in general dynamic games with simultaneous...

This article presents a new approach to analyze the equilibrium set of symmetric, differentiable games by separating multiple symmetric equilibria and asymmetric equilibria. This separation allows the investigation of, for example, how various parameter constellations affect the scope for...

This paper studies the existence of equilibrium solution concepts in a large class of economic models with discontinuous payoff functions. The issue is well understood for Nash equilibria, thanks to Reny’s better-reply security con- dition ( Reny 1999) and its recent improvements (Barelli and...

This paper presents a Schelling-type checkerboard model of residential segregation formulated as a spatial game. It shows that although every agent prefers to live in a mixed-race neighborhood, complete segregation is observed almost all of the time. A concept of tipping is rigorously defined,...

We study models of learning in games where agents with limited memory use social information to decide when and how to change their play. When agents only observe the aggregate distribution of payoffs and only recall information from the last period, aggregate play comes close to Nash...

We analyze the social and private learning at the symmetric equilibria of a queueing game with strategic experimentation. An infinite sequence of agents arrive at a server which processes them at an unknown rate. The number of agents served at each date is either: a geometric random variable in...

This paper studies infinite-horizon stochastic games in which players observe payoffs and noisy public information about a hidden state each period. We find that, very generally, the feasible and individually rational payoff set is invariant to the initial prior about the state in the limit as...