We study how players learn to make decisions if they face many different games. Games are drawn randomly from a set of either two or six games in each of 100 rounds. If either there are few games or if extensive summary information is provided (or both) convergence to the unique Nash equilibrium...

This paper demonstrates the theoretical foundation that underlies the willingness of rational arbitrageurs to delay and reinforce the speculative attack. The key assumptions are that there is a small probability that arbitrageurs are behavioral and never time the market of their own accord and...

This paper considers marriage problems, roommate problems with nonempty core, and college admissions problems with responsive preferences. All stochastically stable matchings are shown to be contained in the set of matchings which are most robust to one-shot deviation.

We prove existence of stationary Markov perfect equilibria in an infinite-horizon model of legislative policy making in which the policy outcome in one period determines the status quo for the next. We allow for a multidimensional policy space and arbitrary smooth stage utilities, and we assume...

An evolutionary style model of recontracting is given which guarantees convergence to core allocations of an underlying cooperative game. Unlike its predecessors in the evolution/learning literature, this is achieved without assumptions of convexity of the characteristic function or a reliance...