Satisficing and optimality in 2×2 common interest games

Summary. The paper studies the evolution of cooperation when satisficing players repeatedly play a symmetric two-by-two game of common interest. We show that if initial aspiration levels are sufficiently close to the efficient payoff and aspiration adjusts at a sufficiently slow speed then the unique long run state will be the efficient outcome. In the special case of coordination games, the more tension there is between payoff dominance and risk dominance, the longer it takes for the system to lock into the payoff dominant outcome. Received: June 23, 1997; revised version: November 19, 1997     

Finitely repeated games with monitoring options

We study finitely repeated games where players can decide whether to monitor the other players? actions or not every period. Monitoring is assumed to be costless and private. We compare our model with the standard one where the players automatically monitor each other. Since monitoring other players never hurts, any equilibrium payoff vector of a standard finitely repeated game is an equilibrium payoff vector of the same game with monitoring options. We show that some finitely repeated games with monitoring options have sequential equilibrium outcomes which cannot be sustained under the standard model, even if the stage game has a unique Nash equilibrium. We also present sufficient conditions for a folk theorem, when the players have a long horizon.     

UNIQUENESS OF EQUILIBRIUM PAYOFFS IN FINITELY REPEATED GAMES WITH IMPERFECT MONITORING*

This paper examines when a finitely repeated game with imperfect monitoring has a unique equilibrium payoff vector. This problem is nontrivial under imperfect monitoring, because uniqueness of equilibrium (outcome) in the stage game does not extend to finitely repeated games. A (correlated) equilibrium is equilibrium minimaxing if any player's equilibrium payoff is her minimax value when the other players choose a correlated action profile from the actions played in the equilibrium. The uniqueness result holds if all stage game correlated equilibria are equilibrium minimaxing and have the same payoffs. The uniqueness result does not hold under weaker conditions.     

Playing safe in coordination games:: the roles of risk dominance, payoff dominance, and history of play

This paper presents results from a series of experiments designed to test the impact on subject behavior of changes in the risk dominance and payoff dominance characteristics of two player coordination games. The main finding is that changes in risk dominance significantly affect play of the subjects, whereas changes in the level of payoff dominance do not. Observed history of play also has an important influence on subject behavior, both when subjects are randomly rematched after each game and when they remain matched with the same individual for a sequence of games.     

Markov Perfect Equilibrium: I. Observable Actions

We define Markov strategy and Markov perfect equilibrium (MPE) for games with observable actions. Informally, a Markov strategy depends only on payoff-relevant past events. More precisely, it is measurable with respect to the coarsest partition of histories for which, if all other players use measurable strategies, each player's decision-problem is also measurable. For many games, this definition is equivalent to a simple affine invariance condition. We also show that an MPE is generically robust: if payoffs of a generic game are perturbed, there exists an almost Markovian equilibrium in the perturbed game near the initial MPE. Journal of Economic Literature Classification Numbers: C72, C73.     

Incentive monotonicity and equilibrium selection in 2×2 matrix games

For the class of 2×2 matrix games with two strict Nash equilibria the paper introduces an equilibrium refinement called incentive monotonicity. It selects the risk-dominant equilibrium if interests are conflicting, while it remains silent in games with common interests. These results suggest that the equilibrium-selection problem might be more difficult in games with common interests, which is certainly the case if risk dominance and payoff dominance go in opposite directions.     

Endogenous Move Structure and Voluntary Provision of Public Goods: Theory and Experiment

In this paper, we examine voluntary contributions to a public good, embedding Varian's (1994) voluntary contribution game in extended games that allow players to choose the timing of their contributions. We show that predicted outcomes are sensitive to the structure of the extended game, and also to the extent to which players care about payoff inequalities. We then report a laboratory experiment based on these extended games. We find that behavior is similar in the two extended games: subjects avoid the detrimental move order of Varian's model, where a person with a high value of the public good commits to a low contribution, and instead players tend to delay contributions. These results suggest that commitment opportunities may be less damaging to public good provision than previously thought.     

Equilibrium play in matches: Binary Markov games

We study two-person extensive form games, or “matches,” in which the only possible outcomes (if the game terminates) are that one player or the other is declared the winner. The winner of the match is determined by the winning of points, in “point games.” We call these matches binary Markov games. We show that if a simple monotonicity condition is satisfied, then (a) it is a Nash equilibrium of the match for the players, at each point, to play a Nash equilibrium of the point game; (b) it is a minimax behavior strategy in the match for a player to play minimax in each point game; and (c) when the point games all have unique Nash equilibria, the only Nash equilibrium of the binary Markov game consists of minimax play at each point. An application to tennis is provided.     

A folk theorem for minority games

We study a particular case of repeated games with public signals. In the stage game an odd number of players have to choose simultaneously one of two rooms. The players who choose the less crowded room receive a reward of one euro (whence the name “minority game”). The players in the same room do not recognize each other, and between the stages only the current majority room is publicly announced. We show that in the infinitely repeated game any feasible payoff can be achieved as a uniform equilibrium payoff, and as an almost sure equilibrium payoff. In particular we construct an inefficient equilibrium where, with probability one, all players choose the same room at almost all stages. This equilibrium is sustained by punishment phases which use, in an unusual way, the pure actions that were played before the start of the punishment.     

Alternating-offer games with final-offer arbitration

I analyze an alternating-offer model that integrates the common practice of having an arbitrator determine the outcomes if both playersʼ offers are rejected. I assume that the arbitrator uses final-offer arbitration (as in professional baseball). I find that if the arbitrator does not excessively favor one player, then the unique subgame-perfect equilibrium always coincides with the subgame-perfect equilibrium outcome in Rubinsteinʼs infinite-horizon alternating-offer game. However, if the arbitrator sufficiently favors the player making the initial offer, then delay occurs in equilibrium.     

When less information is good enough: experiments with global stag hunt games

There is mixed evidence on whether subjects coordinate on the efficient equilibrium in experimental stag hunt games under complete information. A design that generates an anomalously high level of coordination, Rankin et al. (Games Econo Behav 32(2):315–337, 2000), varies payoffs each period in repeated play rather than holding them constant. These payoff “perturbations” are eerily similar to those used to motivate the theory of global games, except the theory operates under incomplete information. Interestingly, that equilibrium selection concept is known to coincide with risk dominance, rather than payoff dominance. Thus, in theory, a small change in experimental design should produce a different equilibrium outcome. We examine this prediction in two treatments. In one, we use public signals to match Rankin et al. (2000)’s design; in the other, we use private signals to match the canonical example of global games theory. We find little difference between treatments, in both cases, subject play approaches payoff dominance. Our literature review reveals this result may have more to do with the idiosyncrasies of our complete information framework than the superiority of payoff dominance as an equilibrium selection principle.     

Binary Games with State Dependent Stochastic Choice

This paper studies a stochastic equilibrium selection model for binary coordination games. Players switch strategies stochastically so that the mistake probabilities are fully dependent on the population states. A probabilistic behavior is said to be aspiration (imitation, resp.) oriented if strategy switches are mainly driven by the aspiration (imitation, resp.) effect. In general, a strategy switch by one player generates externalities on others. Strategies in a coordination game can be classified according to the relative magnitude of their externality effects. It is shown that the selection outcome for a linear coordination game is determined in a specific way by the balance of the risk dominance, the aspiration/imitation, and the externality effects. It is also shown that an aspiration (imitation, resp.) oriented behavior tends to select payoff dominant (maxmin, resp.) equilibrium and that risk dominant equilibrium is always selected if and only if the aspiration and the imitation effects exactly cancel each other out, which in turn makes the selection process insensitive to externality effects. Journal of Economic Literature Classification Number: C72.     

Conditional behavior and learning in similar stag hunt games

This paper reports an experiment using Stag Hunt games with different payoff ranges. Specifically, in one treatment for half of the games the payoff dominant and the risk dominant equilibrium coincide and for the other half of the games they conflict; in the second treatment they always conflict. The experiment provides evidence that the payoff range experienced by the participant influences the likelihood of efficient conventions emerging. In particular, experiencing games where payoff dominance and risk dominance coincide appears to make payoff dominance more attractive in games in which they conflict. In the experiment, we also observe conditional behavior emerging with experience. We develop a model of conditional expectations to explain these stylized facts that depends crucially on the assumption that after a brief learning period participants categorize their experience using the same relative bandwidth in both treatments even though the range of experience is twice as large in treatment 1 as it is in treatment 2. The assumption cannot be rejected by the data. The analysis provides a formal example in which increasing experienced diversity by changing the way similar experiences are categorized increases the likelihood of efficient conventions emerging in communities playing similar Stag Hunt games.     

TIME CONSISTENCY IN ALTERNATING‐MOVE POLICY GAMES*

We examine alternating‐move policy games where the government and the private sector alternate their moves. In contrast with the standard policy game, the set of equilibrium payoffs of the present model is bounded away from the payoff under the one‐shot Nash equilibrium, called the Kydland–Prescott outcome, and the upper bound is close to the payoff under the optimal policy (called the Ramsey policy) if the government is sufficiently patient. In other words, the Kydland–Prescott outcome is not time consistent, while the Ramsey outcome could be approximated by a time‐consistent policy of the same game.     

Repeated games with present-biased preferences

We study infinitely repeated games with perfect monitoring, where players have β-δ preferences. We compute the continuation payoff set using recursive techniques and then characterize equilibrium payoffs. We then explore the cost of the present-time bias, producing comparative statics. Unless the minimax outcome is a Nash equilibrium of the stage game, the equilibrium payoff set is not monotonic in β or δ. Finally, we show how the equilibrium payoff set is contained in that of a repeated game with smaller discount factor.     

Iterated strict dominance in general games

We offer a definition of iterated elimination of strictly dominated strategies (IESDS^*) for games with (in)finite players, (non)compact strategy sets, and (dis)continuous payoff functions. IESDS^* is always a well-defined order independent procedure that can be used to solve Nash equilibrium in dominance-solvable games. We characterize IESDS^* by means of a “stability” criterion, and offer a sufficient and necessary epistemic condition for IESDS^*. We show by an example that IESDS^* may generate spurious Nash equilibria in the class of Reny's better-reply secure games. We provide sufficient/necessary conditions under which IESDS^* preserves the set of Nash equilibria.     

GLOBAL GAMES WITH STRATEGIC SUBSTITUTES

We study global games with strategic substitutes. Specifically, for a class of binary‐action, ‐player games with strategic substitutes, we prove that under payoff asymmetry, as incomplete information vanishes, the global games approach selects a unique equilibrium. We characterize this equilibrium profile ; players employ switching strategies at different cutoff signals, the order of which is directly determined by payoff asymmetry. We provide examples that illustrate our result and its connection with dominance solvability. We extend the global game literature, which has thus far been developed for games with strategic complementarities, to new applications in industrial organization, collective action problems, finance, etc .     

On the folk theorem with one-dimensional payoffs and different discount factors

Proving the folk theorem in a game with three or more players usually requires imposing restrictions on the dimensionality of the stage-game payoffs. Fudenberg and Maskin (1986) assume full dimensionality of payoffs, while Abreu et al. (1994) assume the weaker NEU condition (“nonequivalent utilities”). In this note, we consider a class of n-player games where each player receives the same stage-game payoff, either zero or one. The stage-game payoffs therefore constitute a one-dimensional set, violating NEU. We show that if all players have different discount factors, then for discount factors sufficiently close to one, any strictly individually rational payoff profile can be obtained as the outcome of a subgame-perfect equilibrium with public correlation.     

Demand bargaining and proportional payoffs in majority games

We study a majoritarian bargaining model in which players make payoff demands in decreasing order of voting weight. The unique subgame perfect equilibrium outcome is such that the minimal winning coalition of the players that move first forms with payoffs proportional to the voting weights. This result advances previous analysis in terms of one or more of the following: a) the simplicity of the extensive form (finite horizon with a predetermined order of moves); b) the range of the majority games covered; c) the equilibrium concept (subgame perfect equilibrium is sufficient for a unique prediction).