Communication in repeated network games with imperfect monitoring

I consider repeated games with private monitoring played on a network. Each player has a set of neighbors with whom he interacts: a player's payoff depends on his own and his neighbors' actions only. Monitoring is private and imperfect: each player observes his stage payoff but not the actions of his neighbors. Players can communicate costlessly at each stage: communication can be public, private or a mixture of both. Payoffs are assumed to be sensitive to unilateral deviations. First, for any network, a folk theorem holds if some Joint Pairwise Identifiability condition regarding payoff functions is satisfied. Second, a necessary and sufficient condition on the network topology for a folk theorem to hold for all payoff functions is that no two players have the same set of neighbors not counting each other.     

Strategic information transmission networks

We study a model of multi-player communication. Privately informed decision makers have different preferences about the actions they take, and communicate to influence each others? actions in their favor. We prove that the equilibrium capability of any player to send a truthful message to a set of players depends not only on the preference composition of those players, but also on the number of players truthfully communicating with each one of them. We establish that the equilibrium welfare depends not only on the number of truthful messages sent in equilibrium, but also on how evenly truthful messages are distributed across decision makers.     

Directed Networks with Spillovers

We study noncooperative network formation in two types of directed networks. In the first type, called the model with global spillovers, the payoff of a player depends on the number of links she forms as well as the total number of links formed by all other players. In the second type, called the model with local spillovers, the payoff of a player depends on the number of links she forms and the total number of links formed by her immediate neighbors, as well as the number of links formed by players outside her neighborhood. For both classes of games we investigate the existence of pure strategy Nash equilibria and characterize the Nash networks under a number of different second order conditions on the payoff function.     

Cycling in a stochastic learning algorithm for normal form games

In this paper we study a stochastic learning model for 2×2 normal form games that are played repeatedly. The main emphasis is put on the emergence of cycles. We assume that the players have neither information about the payoff matrix of their opponent nor about their own. At every round each player can only observe his or her action and the payoff he or she receives. We prove that the learning algorithm, which is modeled by an urn scheme proposed by Arthur (1993), leads with positive probability to a cycling of strategy profiles if the game has a mixed Nash equilibrium. In case there are strict Nash equilibria, the learning process converges a.s. to the set of Nash equilibria.     

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.     

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.     

Learning to play games in extensive form by valuation

Game theoretic models of learning which are based on the strategic form of the game cannot explain learning in games with large extensive form. We study learning in such games by using valuation of moves. A valuation for a player is a numeric assessment of her moves that purports to reflect their desirability. We consider a myopic player, who chooses moves with the highest valuation. Each time the game is played, the player revises her valuation by assigning the payoff obtained in the play to each of the moves she has made. We show for a repeated win-lose game that if the player has a winning strategy in the stage game, there is almost surely a time after which she always wins. When a player has more than two payoffs, a more elaborate learning procedure is required. We consider one that associates with each move the average payoff in the rounds in which this move was made. When all players adopt this learning procedure, with some perturbations, then, with probability 1 there is a time after which strategies that are close to subgame perfect equilibrium are played. A single player who adopts this procedure can guarantee only her individually rational payoff.     

Sampling equilibrium, with an application to strategic voting

We suggest an equilibrium concept for a strategic model with a large number of players in which each player observes the actions of only a small number of the other players. The concept fits well situations in which each player treats his sample as a prediction of the distribution of actions in the entire population, and responds optimally to this prediction. We apply the concept to a strategic voting model and investigate the conditions under which a centrist candidate can win the popular vote although his strength in the population is smaller than the strengths of the right and left candidates.     

Reputation with observed actions

Summary A single long-run player plays a fixed stage game (simultaneous orsequential move) against an infinite sequence of short-run opponents that play only once but can observe all past realized actions. Assuming that the probability distributions over types of long and short-run players have full support, we show that the long-run player can always establish a reputation for theStackelberg strategy and is therefore guaranteed almost his Stackelberg payoff in all Nash equilibria of the repeated game.The financial support of the National Science Foundation, Grant SES 90-7999, and of Consiglio Nazionale delle Ricerche is gratefully acknowledged. I wish to thank David Levine, Wolfgang Pesendorfer and Seminar Participants at UCLA, Universidad Carlos III de Madrid and University of Naples for useful discussions and suggestions.     

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     

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     

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     

Heterogeneous network games: Conflicting preferences

In many economic situations, a player pursues coordination or anti-coordination with her neighbors on a network, but she also has intrinsic preferences among the available options. We here introduce a model which allows to analyze this issue by means of a simple framework in which players endowed with an idiosyncratic identity interact on a social network through strategic complements or substitutes. We classify the possible types of Nash equilibria under complete information, finding two thresholds for switching action that relate to the two-player setup of the games. This structure of equilibria is considerably reduced when turning to incomplete information, in a setup in which players only know the distribution of the number of neighbors of the network. For high degrees of heterogeneity in the population the equilibria is such that every player can choose her preferred action, whereas if one of the identities is in the minority frustration ensues.     

Global dynamics in repeated games with additively separable payoffs

This paper studies the global dynamics of a class of infinitely repeated two-player games in which the action space of each player is an interval, and the one-shot payoff of each player is additively separable in actions. We define an immediately reactive equilibrium (IRE) as a pure-strategy subgame perfect equilibrium such that each player's action is a stationary function of the opponent's last action. We completely characterize IREs and their dynamics in terms of certain indifference curves. Our results are used to show that in a prisoners' dilemma game with mixed strategies, gradual cooperation occurs when the players are sufficiently patient, and that in a certain duopoly game, kinked demand curves emerge naturally.     

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.     

Learning with perfect information

For extensive form games with perfect information, consider a learning process in which, at any iteration, each player unilaterally deviates to a best response to his current conjectures of others' strategies; and then updates his conjectures in accordance with the induced play of the game. We show that, for generic payoffs, the outcome of the game becomes stationary, and is consistent with Nash equilibrium. In general, if payoffs have ties or if players observe more of each others' strategies than is revealed by plays of the game, the same result holds provided a rationality constraint is imposed on unilateral deviations: no player changes his moves in subgames that he deems unreachable, unless he stands to improve his payoff there. Moreover, with this constraint, the sequence of strategies and conjectures also becomes stationary, and yields a self-confirming equilibrium.     

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.     

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.     

Uniqueness of Stationary Equilibrium Payoffs in the Baron-Ferejohn Model

We consider a multilateral sequential bargaining model in which the players may differ in their probability of being selected as the proposer and the rate at which they discount future payoffs. For games in which agreement requires less than unanimous consent, we characterize the set of stationary subgame perfect equilibrium payoffs. With this characterization, we establish the uniqueness of the equilibrium payoffs. For the case where the players have the same discount factor, we show that the payoff to a player is nondecreasing in his probability of being selected as the proposer. For the case where the players have the same probability of being selected as the proposer, we show that the payoff to a player is nondecreasing in his discount factor. Journal of Economic Literature Classification numbers: C72, C78, D70.