Testing the TASP: An Experimental Investigation of Learning in Games with Unstable Equilibria

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 use two 4 x 4 games each with a unique mixed Nash equilibrium; one is stable and one is unstable under learning. Both games are versions of Rock-Paper-Scissors with the addition of a fourth strategy, Dumb. Nash equilibrium places a weight of 1/2 on Dumb in both games, but the TASP places no weight on Dumb when the equilibrium is unstable. We also vary the level of monetary payoffs with higher payoffs predicted to increase instability. We find that the high payoff unstable treatment differs from the others. Frequency of Dumb is lower and play is further from Nash than in the other treatments. That is, we find support for the comparative statics prediction of learning theory, although the frequency of Dumb is substantially greater than zero in the unstable treatments.

Payoff levels, loss avoidance, and equilibrium selection in the Stag Hunt: an experimental study

Game theorists typically assume that changing a game’s payoff levels—by adding the same constant to, or subtracting it from, all payoffs—should not affect behavior. While this invariance is an implication of the theory when payoffs mirror expected utilities, it is an empirical question when the “payoffs” are actually money amounts. In particular, if individuals treat monetary gains and losses differently, then payoff–level changes may matter when they result in positive payoffs becoming negative, or vice versa. We report the results of a human–subjects experiment designed to test for two types of loss avoidance: certain–loss avoidance (avoiding a strategy leading to a sure loss, in favor of an alternative that might lead to a gain) and possible–loss avoidance (avoiding a strategy leading to a possible loss, in favor of an alternative that leads to a sure gain). Subjects in the experiment play three versions of Stag Hunt, which are identical up to the level of payoffs, under a variety of treatments. We find differences in behavior across the three versions of Stag Hunt; these differences are hard to detect in the first round of play, but grow over time. When significant, the differences we find are in the direction predicted by certain– and possible–loss avoidance. Our results carry implications for games with multiple equilibria, and for theories that attempt to select among equilibria in such games.

Dominance Solvable Games with Multiple Payoff Criteria.

Two logically distinct and permissive extensions of iterative weak dominance are introduced for games with possibly vector-valued payoffs. The first, iterative partial dominance, builds on an easy-to check condition but may lead to solutions that do not include any (generalized) Nash equilibria. However, the second and intuitively more demanding extension, iterative essential dominance, is shown to be an equilibrium refinement. The latter result includes Moulin’s (1979) classic theorem as a special case when all players’ payoffs are real-valued. Therefore, essential dominance solvability can be a useful solution concept for making sharper predictions in multicriteria games that feature a plethora of equilibria.