Finitely Many Players with Bounded Recall in Infinitely Repeated Games

We study the set of limit points of equilibrium payoffs in n-player repeated games, with bounded recall, when the memory capacities of all the players grow to infinity. Two main issues are explored: (i) whether differential information enables players to play correlatively, and (ii) the extent to which boundedly rational players can learn others′ behavior patterns and conceal their own. Journal of Economic Literature Classification Number: 026.     

Nash Equilibria of Repeated Games with Observable Payoff Vectors

We study a model of repeated games with imperfect monitoring where the payoff vector is observable. In this situation, any profitable deviation is detectable by all the players but the identity of the deviator may be unknown. We design collective punishments directed against the set of potential deviators. A particular class of signals is studied for which a characterization of the set of equilibrium payoffs is obtained. Journal of Economic Literature Classification Numbers: C73.     

A Property of Nash Equilibria in Repeated Games with Incomplete Information

We consider two-person non-zero-sum infinitely repeated games with lack of information on one side. The characterization of Nash equilibrium payoffs obtained by Hart allows for complex strategies, which are actually required by some equilibrium payoffs in some games. We show that appropriate one-shot public communication mechanisms make Nash equilibrium payoffs achievable by means of simple strategies. Furthermore, these mechanisms satisfy a notion of self-fulfillment.Journal of Economic LiteratureClassification Numbers: D82, C72.     

On ‘Informationally Robust Equilibria’ for Bimatrix Games

Informationally robust equilibria (IRE) are introduced in Robson (Games Econ Behav 7: 233–245, 1994) as a refinement of Nash equilibria for strategic games. Such equilibria are limits of a sequence of (subgame perfect) Nash equilibria in perturbed games where with small probability information about the strategic behavior is revealed to other players (information leakage). Focusing on bimatrix games, we consider a type of informationally robust equilibria and derive a number of properties they form a non-empty and closed subset of the Nash equilibria. Moreover, IRE is a strict concept in the sense that the IRE are independent of the exact sequence of probabilities with which information is leaked. The set of IRE, like the set of Nash equilibria, is the finite union of polytopes. In potential games, there is an IRE in pure strategies. In zero-sum games, the set of IRE has a product structure and its elements can be computed efficiently by using linear programming. We also discuss extensions to games with infinite strategy spaces and more than two players. The authors would like to thank Marieke Quant for her helpful comments.     

On the Number of Pure Strategy Nash Equilibria in Random Games

How many pure Nash equilibria can we expect to have in a finite game chosen at random? Solutions to the above problem have been proposed in some special cases. In this paper we assume independence among the profiles, but we allow either positive or negative dependence among the players' payoffs in a same profile. We provide asymptotic results for the distribution of the number of Nash equilibria when either the number of players or the number of strategies increases. We will show that different dependence assumptions lead to different asymptotic results. Journal of Economic Literature Classification Number C72.     

Renegotiation in Repeated Games with Side-Payments

We consider repeated games with side-payments: players have an endowment of wealth in each period in which transfers can be made. We show that if endowments are large enough and the common discount factor high enough, then a strongly renegotiation–proof equilibrium (SRP) in the sense of Farrell and Maskin exists. As the discount factor goes to 1, the set of SRP payoffs converges to the set of efficient, individually rational payoffs. These results provide a justification for the efficiency principle when agreements are not enforceable. Journal of Economic Literature Classification Numbers: C73, D23, L14.     

Repeated Games with Bounded Entropy

We investigate the asymptotic behavior of the maxmin values of repeated two-person zero-sum games with a bound on the strategic entropy of the maximizer's strategies while the other player is unrestricted. We will show that if the bound η(n), a function of the number of repetitions n, satisfies the condition η(n)/n → γ (n → ∞), then the maxmin value Wⁿ(η(n)) converges to (cav U)(γ), the concavification of the maxmin value of the stage game in which the maximizer's actions are restricted to those with entropy at most γ. A similar result is obtained for the infinitely repeated games. Journal of Economic Literature Classification Numbers: C73, C72.     

Markov Equilibria of Stochastic Games with Complementarities

The existence of Markov equilibria for stochastic games with a continuum of states is a complex issue for which no general result holds as yet. In this article, the problem is solved for a class of stochastic games that satisfy assumptions of complementarity and monotonicity. The proof of existence relies on results from lattice programming. In the Markov equilibria singled out by the Theorem of Existence, the policies and continuation values are increasing and Lipschitz continuous functions of the state variable.Journal of Economic LiteratureClassification Numbers: C62, C73.     

Quantal Response Equilibria for Extensive Form Games

This article investigates the use of standard econometric models for quantal choice to study equilibria of extensive form games. Players make choices based on a quantal-choice model and assume other players do so as well. We define an agent quantal response equilibrium (AQRE), which applies QRE to the agent normal form of an extensive form game and imposes a statistical version of sequential rationality. We also define a parametric specification, called logit-AQRE, in which quantal-choice probabilities are given by logit response functions. AQRE makes predictions that contradict the invariance principle in systematic ways. We show that these predictions match up with some experimental findings by Schotter et al. (1994) about the play of games that differ only with respect to inessential transformations of the extensive form. The logit-AQRE also implies a unique selection from the set of sequential equilibria in generic extensive form games. We examine data from signaling game experiments by Banks et al. (1994) and Brandts and Holt (1993). We find that the logit-AQRE selection applied to these games succeeds in predicting patterns of behavior observed in these experiments, even when our prediction conflicts with more standard equilibrium refinements, such as the intuitive criterion. We also reexamine data from the McKelvey and Palfrey (1992) centipede experiment and find that the AQRE model can account for behavior that had previously been explained in terms of altruistic behavior. This revised version was published online in August 2006 with corrections to the Cover Date.     

Perfect and Proper Equilibria of Large Games

This paper deals with the existence and other related issues of perfect and proper equilibria of games with a continuum of players. A sufficient condition for the existence of a perfect (proper) equilibrium as an almost everywhere limit of a sequence of ε-perfect (ε-proper) equilibria is given. An example shows that almost everywhere convergence need not obtain if the condition is violated. Extension to the case where the set of actions available to the players can differ is discussed.Journal of Economic LiteratureClassification Number: C79.     

Egalitarianism and Efficiency in Repeated Symmetric Games

We analyze the symmetric equilibria of repeated symmetric games where there is a conflict of interests over equilibria—the battle-of-the-sexes or the hawk–dove game are key examples. If one restricts attention to symmetric equilibria, efficient equilibria must be egalitarian. For finitely repeated games, and generic discount factors, there is a unique outcome path which ensures efficiency within the class of symmetric equilibria. This is also true for the infinitely repeated games if the players are sufficiently impatient. Journal of Economic Literature Classification Numbers: C72, C73.     

Communication in Repeated Games with Private Monitoring

The paper considers repeated games where each player can be observed by only a subset of the other players, and where players can make public announcements about the behavior of the players they observed. We address the following question: What is the minimal level of observability that is required to obtain efficient outcomes? The main result is that the limit set of sequential equilibrium payoffs, when the discount factor tends to one, contains the set of individual rational payoffs whenever each player is observed by at leasttwoother players.Journal of Economic LiteratureClassification Number: C73.     

Belief-Based Equilibria in the Repeated Prisoners' Dilemma with Private Monitoring

We analyze repeated prisoners' dilemma games with imperfect private monitoring and construct mixed trigger strategy equilibria. Such strategies have a simple representation, where a player's action only depends upon her belief that her opponent(s) are continuing to cooperate. When monitoring is almost perfect, the symmetric efficient outcome can be approximated in any prisoners' dilemma game, while every individually rational feasible payoff can be approximated in a class of such games. The efficiency result extends when there are more than two players. It requires that monitoring be sufficiently accurate but does not require very low discounting when a public randomization device is available. Journal of Economic Literature Classification Numbers: C73, D82.     

Credible Equilibria in Games with Utilities Changing during the Play

Whenever one deals with an interactive decision situation of long duration, one has to take into account that priorities of the participants may change during the conflict. In this paper we propose an extensive-form game model to handle such situations and suggest and study a solution concept, called credible equilibrium, which generalizes the concept of Nash equilibrium. We also discuss possible variants to this concept and applications of the model to other types of games. American Mathematical Society Classification Numbers: 90A06, 90A07, 90A43, 90A56, 90D06, 90D10, 90D35, 90D40, 90D80. Journal of Economic Literature Classification Numbers: C70, C72, D10, D11, D80, D83.     

Introduction to Repeated Games with Private Monitoring

We present a brief overview of recent developments in discounted repeated games with (imperfect) private monitoring. The literature explores the possibility of cooperation in a long-term relationship, where each agent receives imperfect private information about the opponents' actions. Although this class of games admits a wide range of applications such as collusion under secret price-cutting, exchange of goods with uncertain quality, and observation errors, it has fairly complex mathematical structure due to the lack of common information shared by players. This is in sharp contrast to the well-explored case of repeated games under public information (with the celebrated Folk Theorems), and until recently little had been known about the private monitoring case. However, rapid developments in the past few years have revealed the possibility of cooperation under private monitoring for some class of games. Journal of Economic Literature Classification Numbers: C72, C73, D43, D82, L13, L41.     

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.     

Cost Structures and Nash Play in Repeated Cournot Games

This paper reports an experiment designed to assess the effects of a rotation in the marginal cost curve on convergence in a repeated Cournot triopoly. Increasing the cost curve's slope both reduces the serially-undominated set to the Nash prediction, and increases the peakedness of earnings. We observe higher rates of Nash equilibrium play in the design with the steeper marginal cost schedule, but only when participants are also rematched after each decision. Examination of response patterns suggests that the treatment with a steeper marginal cost curve and with a re-matching of participants across periods induces the selection of Nash Consistent responses.     

On Non-Nash Equilibria

I consider generalisations of the Nash equilibrium concept based on the idea that in equilibrium the players' beliefs should not be contradicted, even if they could possibly be incorrect. This possibility depends on the information about opponents' behaviour available to the players in equilibrium. Therefore the players' information is crucial for this notion of equilibrium, called Conjectural Equilibrium in general and Rationalizable Conjectural Equilibrium (Rubinstein-Wolinsky 1994) when the game and the players' Bayesian rationality are common knowledge. In this paper I argue for a refinement of Rationalizable Conjectural Equilibrium showing by propositions and by examples how this equilibrium notion works and how the suitable equilibrium concept depends on the players' information.Journal of Economic LiteratureClassification Numbers: C72, D83, D82.     

Comparing Open-loop With Markov Equilibria in a Class of Differential Games

We consider a class of differential games with transition equations that are homogeneous of degree one. For any game G with a discount rate r , consider a Markov-perfect equilibrium (MPE) with strategies that are linear in the state variables. We show that the time paths of the control variables of this equilibrium constitute an open-loop equilibrium of a corresponding game G , which differs from G only in that its rate of discount r is equal to r plus a suitably chosen constant. In the context of a resource depletion game, this implies that the open-loop solution is more conservationist.
JEL Classification Nos.: C72, C73, Q30.