Na and Shin (1998) showed that the veil of uncertainty can be conducive to the success of self-enforcing international environmental agreements. Later papers confirmed this negative conclusion about the role of learning. In the light of intensified research efforts worldwide to reduce...

We characterize the smallest faces of the polyhedron of strategy profiles that could possibly be made asymptotically stable under some reasonable deterministic dynamics. These faces are Kalai and Samet's (1984) persistent retracts and are spanned by Basu and Weibull's (1991) CURB sets based on a...

Equilibrium notions for games with unawareness in the literature cannot be interpreted as steady-states of a learning process because players may discover novel actions during play. In this sense, many games with unawareness are "self-destroying" as a player's representation of the game may...

We analyze a symmetric n-firm Cournot oligopoly with a heterogeneous population of optimizers and imitators. Imitators mimic the output decision of the most successful firms of the previous round à la Vega-Redondo (1997). Optimizers play a myopic best response to the opponents' previous output....

This paper studies how updating affects ambiguity-attitude. In particular we focus on the generalized Bayesian update of the Jaffray-Phillipe sub-class of Choquet Expected Utility preferences. We find conditions for ambiguity-attitude to be the same before and after updating. A necessary and...

This paper studies how updating affects ambiguity-attitude. In particular we focus on the generalized Bayesian update of the Jaffray-Phillipe sub-class of Choquet Expected Utility preferences. We find conditions for ambiguity-attitude to be the same before and after updating. A necessary and...

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 show that for many classes of symmetric two-player games, the simple decision rule "imitate-the-best" can hardly be beaten by any other decision rule. We provide necessary and sufficient conditions for imitation to be unbeatable and show that it can only be beaten by much in games that are of...

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 analyze a symmetric n-firm Cournot oligopoly with a heterogeneous population of optimizers and imitators. Imitators mimic the output decision of the most successful firms of the previous round a l`a Vega-Redondo (1997). Optimizers play a myopic best response to the opponents' previous output....