A folk theorem for repeated games played on a network

I consider repeated games on a network where players interact and communicate with their neighbors. At each stage, players choose actions and exchange private messages with their neighbors. The payoff of a player depends only on his own action and on the actions of his neighbors. At the end of each stage, a player is only informed of his payoff and of the messages he received from his neighbors. Payoffs are assumed to be sensitive to unilateral deviations. The main result is to establish a necessary and sufficient condition on the network for a Nash folk theorem to hold, for any such payoff function.     

How complex are networks playing repeated games?

Summary. This paper examines implications of complexity cost in implementing repeated game strategies through networks with finitely many classifiers. A network consists of individual classifiers that summarize the history of repeated play according to a weighted sum of the empirical frequency of the outcomes of the stage game, and a decision unit that chooses an action in each period based on the summaries of the classifiers. Each player maximizes his long run average payoff, while minimizing the complexity cost of implementing his strategy through a network, measured by its number of classifiers. We examine locally stable equilibria where the selected networks are robust against small perturbations. In any locally stable equilibrium, no player uses a network with more than a single classifier. Moreover, the set of locally stable equilibrium payoff vectors lies on two line segments in the payoff space of the stage game. Received: May 9, 1997; revised version: November 18, 1997     

INCOMPLETE INFORMATION GAMES WITH MULTIPLE PRIORS*

We present a model of incomplete information games, where each player is endowed with a set of priors. Upon arrival of private information, it is assumed that each player “updates” his set of priors to a set of posterior beliefs, and then evaluates his actions by the most pessimistic posterior beliefs. So each player's preferences may exhibit aversion to ambiguity or uncertainty. We define a couple of equilibrium concepts, establish existence results for them, and demonstrate by examples how players’ views on uncertainty about the environment affect the strategic outcomes.     

Minimum Memory for Equivalence between Ex Ante Optimality and Time-Consistency

I give a necessary and sufficient condition on memory of a player in an extensive game for equivalence between ex ante optimality and time-consistency (for all payoff assignments). The condition is called A-loss recall and requires that each loss of a player's memory can be traced back to some loss of memory of his own action. A-loss recall is also shown to be a necessary and sufficient condition for the existence of a time-consistent strategy (for all payoff assignments) if the player is conscious-minded. Journal of Economic Literature Classification Numbers: C72, D80.     

Finite automata play the repeated prisoner's dilemma

The paper studies two-person supergames. Each player is restricted to carry out his strategies by finite automata. A player's aim is to maximize his average payoff and subject to that, to minimize the number of states of his machine. A solution is defined as a pair of machines in which the choice of machine is optimal for each player at every stage of the game. Several properties of the solution are studied and are applied to the repeated prisoner's dilemma. In particular it is shown that cooperation cannot be the outcome of a solution of the infinitely repeated prisoner's dilemma.     

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.     

The single deviation property in games with discontinuous payoffs

We study equilibrium existence in normal form games in which it is possible to associate with each nonequilibrium point an open neighborhood, a set of players, and a collection of deviation strategies, such that at any nonequilibrium point of the neighborhood, a player from the set can increase her payoff by switching to the deviation strategy designated for her. An equilibrium existence theorem for compact, quasiconcave games with two players is established as an application of a general equilibrium existence result for qualitative games. A new form of the better-reply security condition, called the strong single deviation property, is proposed.     

The folk theorem for repeated games with observation costs

The folk theorem literature has been relaxing the assumption on how much players know about each other's past action. Here we consider a general model where players can “buy” precise information. Every period, each player decides whether to pay a cost to accurately observe the actions chosen by other players in the previous period. When a player does not pay the cost, he obtains only imperfect private signals. Observational decisions are unobservable to others. Known strategies such as trigger strategies do not work since they fail to motivate players to pay for information. This paper shows that the folk theorem holds for any level of observation costs. Unlike existing folk theorems with private monitoring, ours imposes virtually no restriction on the nature of costless imperfect signals. The theorem does not use explicit or costless communication, thereby having implications on antitrust laws that rely on evidence of explicit communication. The main message is that accurate observation alone, however costly, enables efficient cooperation in general repeated games.     

A Folk Theorem for Repeated Sequential Games

We study repeated sequential games where players may not move simultaneously in stage games. We introduce the concept of effective minimax for sequential games and establish a Folk theorem for repeated sequential games. The Folk theorem asserts that any feasible payoff vector where every player receives more than his effective minimax value in a sequential stage game can be supported by a subgame perfect equilibrium in the corresponding repeated sequential game when players are sufficiently patient. The results of this paper generalize those of Wen (1994), and of Fudenberg and Maskin (1986). The model of repeated sequential games and the concept of effective minimax provide an alternative view to the Anti–Folk theorem of Lagunoff and Matsui (1997) for asynchronously repeated pure coordination games.     

Dismissals and quits in repeated games

This paper studies repeated games, where player 1 can decide to let the opponent continue or replace her by a new player. We also allow for the possibility of player 2 quitting the game. When only layoffs can occur, a folk theorem for finite horizons obtains due to the threat that termination of the relationship imposes on player 2. However, quits limit this result to those cases in which the outside option for player 2 is small (lower than some Nash equilibrium payoff of the stage game).     

Games played in a contracting environment

We analyze normal form games where a player has to pay a price to a supplier in order to play a specific action. Our focus is on supplier competition, arising from the fact that distinct suppliers supply different players, and possibly different actions of the same player. With private contracts, where a player only observes the prices quoted by his own suppliers, the set of equilibrium distributions over player actions coincides with the set of equilibrium distributions when all actions are supplied competitively, at cost. With public contracts, the two distributions differ dramatically even in simple games.     

Games played in a contracting environment

We analyze normal form games where a player has to pay a price to a supplier in order to play a specific action. Our focus is on supplier competition, arising from the fact that distinct suppliers supply different players, and possibly different actions of the same player. With private contracts, where a player only observes the prices quoted by his own suppliers, the set of equilibrium distributions over player actions coincides with the set of equilibrium distributions when all actions are supplied competitively, at cost. With public contracts, the two distributions differ dramatically even in simple games.     

Markov perfect equilibria in industries with complementarities

Summary.   This paper considers the existence and computation of Markov perfect equilibria in games with a “monotone” structure. Specifically, it provides a constructive proof of the existence of Markov perfect equilibria for a class of games in which a) there is a continuum of players, b) each player has the same per period payoff function and c) these per period payoff functions are supermodular in the player's current and past action and have increasing differences in the player's current action and the entire distribution of actions chosen by other players. The Markov perfect equilibria that are analyzed are symmetric, not in the sense that each player adopts the same action in any period, but rather in the sense that each player uses the same policy function. Since agents are typically distributed across many states they will typically take different actions. The formal environment considered has particular application to models of industries (or economies) in which firms face costs of price adjustment. It is in this context that the results are developed. Received: November 9, 1999; revised version: February 10, 2000     

Aggregate comparative statics

In aggregative games, each playerʼs payoff depends on her own actions and an aggregate of the actions of all the players. Many common games in industrial organization, political economy, public economics, and macroeconomics can be cast as aggregative games. This paper provides a general and tractable framework for comparative static results in aggregative games. We focus on two classes of games: (1) aggregative games with strategic substitutes and (2) nice aggregative games, where payoff functions are continuous and concave in own strategies. We provide simple sufficient conditions under which positive shocks to individual players increase their own actions and have monotone effects on the aggregate. The results are illustrated with applications to public good provision, contests, Cournot competition and technology choices in oligopoly.     

An evolutionary edge of knowing less (or: On the ‘curse’ of global information)

Consider a population of farmers who live around a lake. Each farmer engages in trade with his two adjacent neighbors. The trade is governed by a prisoner’s dilemma ‘rule of engagement.’ A farmer’s payoff is the sum of the payoffs from the two prisoner’s dilemma games played with his two neighbors. When a farmer dies, his son takes over. The son decides whether to cooperate or defect by considering the actions taken and the payoffs received by the most prosperous members of the group comprising his own father and a set of his father’s neighbors. The size of this set, which can vary, is termed the ‘span of information.’ It is shown that a larger span of information can be detrimental to the stable coexistence of cooperation and defection, and that in well-defined circumstances, a large span of information leads to an end of cooperation, whereas a small span does not. Conditions are outlined under which, when individuals’ optimization is based on the assessment of less information, the social outcome is better than when optimization is based on an assessment of, and a corresponding response to, more information.     

Nash equilibria in ∞-dimensional spaces: an approximation theorem

Summary. We show, by employing a density result for probability measures, that in games with a finite number of players and ∞-dimensional pure strategy spaces Nash equilibria can be approximated by finite mixed strategies. Given ε>0, each player receives an expected utility payoff ε/2 close to his Nash payoff and no player could change his strategy unilaterally and do better than ε. Received: July 15, 1997; revised version: February 6, 1998     

Characterization of the extreme core allocations of the assignment game

A characterization of the extreme core allocations of the assignment game is given in terms of the reduced marginal worth vectors. For each ordering in the player set, a payoff vector is defined where each player receives his or her marginal contribution to a certain reduced game played by his or her predecessors. This set of reduced marginal worth vectors, which for convex games coincide with the usual marginal worth vectors, is proved to be the set of extreme points of the core of the assignment game. Therefore, although assignment games are hardly ever convex, the same characterization of extreme core allocations is valid for convex games.     

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.     

On the convergence to the Nash bargaining solution for action-dependent bargaining protocols

We consider a non-cooperative multilateral bargaining game and study an action-dependent bargaining protocol, that is, the probability with which a player becomes the proposer in a round of bargaining depends on the identity of the player who previously rejected. An important example is the frequently studied rejector-becomes-proposer protocol. We focus on subgame perfect equilibria in stationary strategies which are shown to exist and to be efficient. Equilibrium proposals do not depend on the probability to propose conditional on the rejection by another player. We consider the limit, as the bargaining friction vanishes. In case no player has a positive probability to propose conditional on his rejection, each player receives his utopia payoff conditional on being recognized. Otherwise, equilibrium proposals of all players converge to a weighted Nash bargaining solution, where the weights are determined by the probability to propose conditional on one's own rejection.     

ON THE NEUTRALITY OF COALITION FORMATION IN A PURE BARGAINING PROBLEM*

We consider the sequential bargaining game à la Stahl–Binmore–Rubinstein with random proposers, juxtaposing an ex ante coalition formation stage to their bargaining game. On the basis of the expected outcomes in the negotiation over how to split a dollar, players can form coalitions in a sequential manner, within each of which they can redistribute their payoffs. It turns out that the grand coalition does form, and that each player receives his discounted expected payoff, which is obtained by playing as a single player in the negotiation, although there could be many equilibria in the bargaining stage.