We present a non-technical account of ambiguity in strategic games and show how it may be applied to economics and social sciences. Optimistic and pessimistic responses to ambiguity are formally modelled. We show that pessimism has the effect of increasing (decreasing) equilibrium prices under...

We present a non-technical account of ambiguity in strategic games and show how it may be applied to economics and social sciences. Optimistic and pessimistic responses to ambiguity are formally modelled. We show that pessimism has the effect of increasing (decreasing) equilibrium prices under...

We seek an evolutionary explanation for why in some situations humans maintain either optimistic or pessimistic attitudes towards uncertainty and are ignorant to relevant aspects of their environment. Players in strategic games face Knightian uncertainty about opponents' actions and maximize...

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. Weprovide necessary and sufficient conditions for imitation to be unbeatable and showthat it can only be beaten by much in games that are of...

Internet experiments are a new and convenient way for reaching a large subject pool. Yet, providing incentives to subjects can be a tricky design issue. One cost effective and simple method is the publication of a high score (as in computer games). We test whether a high score provides adequate...

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 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 show that in symmetric two-player exact potential games, the simple decision rule "imitate-if-better" cannot be beaten by any strategy in a repeated game by more than the maximal payoff difference of the one-period game. Our results apply to many interesting games including examples like 2x2...