A learning rule is uncoupled if a player does not condition his strategy on the opponent's payoffs. It is radically uncoupled if a player does not condition his strategy on the opponent's actions or payoffs. We demonstrate a family of simple, radically uncoupled learning rules whose...

This paper analyzes the effect of the availability of information about the payoff structure on the behavior of players in a Common-Pool Resource game. Six groups of six individuals played a complete information game, while other six groups played the same game but with no information about the...

Two subjects have to repeatedly choose between two alternatives, A and B, where payoffs of an A or B-choice depend on the choices made by both players in a number of previous choices. Locally, alternative A gives always more payoff than alternative B. However, in terms of overall payoffs...

We consider the regret matching process with finite memory. For general games in normal form, it is shown that any recurrent class of the dynamics must be such that the action profiles that appear in it constitute a closed set under the “same or better reply” correspondence (CUSOBR set) that...

In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...

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....

We explore in an equilibrium framework whether games with multiple Nash equilibria are easier to play when players can communicate. We consider two variants, modelling talk about future plans and talk about past actions. The language from which messages are chosen is endogenous, messages are...

We analyze subjects' eye movements while they make decisions in a series of one-shot games. The majority of them perform a partial and selective analysis of the payoff matrix, often ignoring the payoffs of the opponent and/or paying attention only to specific cells. Our results suggest that...

A strategy profile of a game is called robustly stochastically stable if it is stochastically stable for a given behavioral model independently of the specification of revision opportunities and tie-breaking assumptions in the dynamics. We provide a simple radius-coradius result for robust...

Games with multiple Nash equilibria are believed to be easier to play if players can communicate. We present a simple model of communication in games and investigate the importance of when communication takes place. Sending a message before play captures talk about intentions, after play...