In clock games, agents receive differently-timed private signals when an asset value is above its fundamental. The price crashes to the fundamental when K of N agents have decided to sell. If selling decisions are private, bubbles can be sustained because people delay selling, after receiving...

This paper reports results of a 100-round Yes-No game experiment conducted under the random matching protocol. In contrast to ultimatum bargaining, the responder in the Yes-No game decides whether to accept without knowing the proposer’s offer. Although both games have the same solution...

Mixed Nash equilibria are a cornerstone of game theory, but their empirical relevance has always been controversial. We study in the laboratory two games whose unique NE is in completely mixed strategies; other treatments include the matching protocol (pairwise random vs population...

Models with heterogeneous interacting agents explain macro phenomena through interactions at the micro level. We propose genetic algorithms as a model for individual expectations to explain aggregate market phenomena. The model explains all stylized facts observed in aggregate price fluctuations...

We test the no-trade theorem in a laboratory financial market where subjects can trade an asset whose value is unknown. Subjects receive clues on the asset value and then set a bid and an ask at which they are willing to buy or to sell from the other participants. In treatments with no gains...

The need for efficient coordination is ubiquitous in organizations and industries. The literature on the determinants of efficient coordination has focused on individual decision making so far. In reality, however, teams often have to coordinate with other teams. We present a series of...

In this paper we introduce four new learning models: impulse balance learning, impulse matching learning, action-sampling learning, and payof-sampling learning. With this models and together with the models of self-tuning EWA learning and reinforcement learning, we conduct simulations over 12...

We use an experiment to explore how subjects learn to play against computers which are programmed to follow one of a number of standard learning algorithms. The learning theories are (unbeknown to subjects) a best response process, fictitious play, imitation, reinforcement learning, and a trial...

We study beliefs and choices in a repeated normal-form game. In addition to a baseline treatment with common knowledge of the game structure and feedback about choices in the previous period, we run treatments (i) without feedback about previous play, (ii) with no information about the...

We report experiments designed to test between Nash equilibria that are stable and unstable under learning. The “TASP” (Time Average of the Shapley Polygon) gives a precise prediction about what happens when there is divergence from equilibrium under fictitious play like learning processes....