In a model inspired by neuroscience, we show that constrained optimal perception encodes lottery rewards using an S-shaped encoding function and over-samples low-probability events. The implications of this perception strategy for behavior depend on the decision-maker’s understanding of the...

We study maximum-likelihood estimation and updating, subject to computational, cognitive, or behavioral constraints. We jointly characterize constrained estimates and updating within a framework reminiscent of a machine learning algorithm. Without frictions, the framework simplifies to standard...

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 study a learning process in which subjects extrapolate from their experience of similar past strategic situations to the current decision problem. When applied to coordination games, this learning process leads to contagion of behavior from problems with extreme payoffs and unique equilibria...

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