We argue that some, but not all, superstitions can persist when learning is rational and players are patient, and illustrate our argument with an example inspired by the Code of Hammurabi. The code specified an “appeal by surviving in the river†as a way of deciding whether an...

Di erent discrete time triangular arrays representing a noisy signal of players' activities can lead to the same limiting di usion process yet lead to di erent limit equilibria. Whether the limit equilibria are equilibria of the limiting continuous time game depends on the limit properties of...

We characterize a generalization of discounted logistic choice that incorporates a parameter to capture different views the agent might have about the costs and benefits of larger choice sets. The discounted logit model used in the empirical literature is the special case that displays a...

We show the existence of a pure strategy, symmetric, increasing equilibrium in dou- ble auction markets with correlated, conditionally independent private values and many participants. The equilibrium we ï¬nd is arbitrarily close to fully revealing as the market size grows. Our results provide...

We study repeated games with frequent actions and frequent imperfect public signals, where the signals are aggregates of many discrete events, such as sales or tasks. The high-frequency limit of the equilibrium set depends both on the probability law governing the discrete events and on how many...

We define and analyze a "strategic topology'' on types in the Harsanyi-Mertens-Zamir universal type space, where two types are close if their strategic behavior is similar in all strategic situations. For a fixed game and action define the distance between a pair of types as the difference...

In some experiments rational players who understand the structure of the game could improve their payoff. We bound the size of the observed losses in several such experiments. To do this, we suppose that observed play resembles an equilibrium because players learn about their opponents' play....

We present a general algorithm for computing the limit, as δ → 1, of the set of payoffs of perfect public equilibria of repeated games with long-run and short-run players, allowing for the possibility that the players′ actions are not observable by their opponents. We illustrate...

We examine the rational expectations equilibrium paths of the model of search and barter in Diamond's "Aggregate Demand Management in Search Equilibrium." For some initial positions, there are two equilibrium paths converging to different steady states, with the high-activity path...

The foundations of incomplete contracts have been questioned using or extending the subgame perfect implementation approach of Moore and Repullo (1988). We consider the robustness of subgame perfect implementation to the introduction of small amounts of asymmetric information. We show that...