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

In monopoly pricing situations, firms should optimally vary prices to learn demand. The variation must be sufficiently high to ensure complete learning. In competitive situations, however, varying prices provides information to competitors and may reduce the value of learning. Such situations...

Tuning one's shower in some hotels may turn into a challenging coordination game with imperfect information. The temperature sensitivity increases with the number of agents, making the problem possibly unlearnable. Because there is in practice a finite number of possible tap positions, identical...

Tuning one's shower in some hotels may turn into a challenging coordination game with imperfect information. The temperature sensitivity increases with the number of agents, making the problem possibly unlearnable. Because there is in practice a finite number of possible tap positions, identical...

We show that the playing sequence-the order in which players update their actions-is a crucial determinant of whether the best-response dynamic converges to a Nash equilibrium. Specifically, we analyze the probability that the best-response dynamic converges to a pure Nash equilibrium in random...

This paper illustrates that least squares learning may lead to suboptimal outcomes even when the estimated function perfectly fits the observations used in the regression. We consider the Salop model with three firms and two types of consumers that face different transportation costs. Firms do...

In a coordination game such as the Battle of the Sexes, agents can condition their plays on external signals that can, in theory, lead to a Correlated Equilibrium that can improve the overall payoffs of the agents. Here we explore whether boundedly rational, adaptive agents can learn to...

Probabilistic equilibrium selection is defined by equipping a set of theoretical solutions with an additive weighting function. In the context of dynamic processes, a weighting function can be constructed by assigning to each theoretical solution a weight equal to the relative size of its basin...

We show that all the fundamental properties of competitive equilibrium in Marshall's theory of value, as presented in Note XXI of the mathematical appendix to his Principles of Economics (1890), derive from the Strong Law of Demand. This is, existence, uniqueness, optimality, global stability of...

We study a class of forward looking economic models with heterogeneous agents in a bounded rationality setting. The agents employ the same recursive learning rule to update beliefs but are characterized by different memory parameters. The peculiarity of the learning mechanism is that the...