Communication equilibrium payoffs in repeated games with imperfect monitoring

We characterize the set of communication equilibrium payoffs of any undiscounted repeated matrix-game with imperfect monitoring and complete information. For two-player games, a characterization is provided by Mertens, Sorin, and Zamir (Repeated games, Part A (1994) CORE DP 9420), mainly using Lehrer's (Math. Operations Res. (1992) 175) result for correlated equilibria. The main result of this paper is to extend this characterization to the n-player case. The proof of the characterization relies on an analogy with an auxiliary 2-player repeated game with incomplete information and imperfect monitoring. We use Kohlberg's (Int. J. Game Theory (1975) 7) result to construct explicitly a canonical communication device for each communication equilibrium payoff.     

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.     

Perfect communication equilibria in repeated games with imperfect monitoring

This paper introduces an equilibrium concept called perfect communication equilibrium for repeated games with imperfect private monitoring. This concept is a refinement of Myerson's [Myerson, R.B., 1982. Optimal coordination mechanisms in generalized principal agent problems, J. Math. Econ. 10, 67–81] communication equilibrium. A communication equilibrium is perfect if it induces a communication equilibrium of the continuation game, after every history of messages of the mediator. We provide a characterization of the set of corresponding equilibrium payoffs and derive a Folk Theorem for discounted repeated games with imperfect private monitoring.     

Collusion through mediated communication in repeated games with imperfect private monitoring

Summary. This paper studies repeated games with imperfect private monitoring when there exists a third-party mediator who coordinates play by giving non-binding instructions to players on which action to take and by collecting their private information. The paper presents a Nash-threat folk theorem for a communication equilibrium based on such mediation when monitoring is jointly -perfect in the sense that every player is almost perfectly monitored collectively by other players.JEL Classification Numbers: C72, D82.I am very grateful to Mark Armstrong, V. Bhaskar, and Michihiro Kandori for helpful comments. Part of this research was conducted while I was visiting the University College London. Their hospitality is gratefully acknowledged.     

Existence of nontrivial equilibria in repeated games with imperfect private monitoring

We consider finitely repeated games with imperfect private monitoring, and provide several sufficient conditions for such a game to have an equilibrium whose outcome is different from repetition of Nash equilibria of the stage game. Surprisingly, the conditions are consistent with uniqueness of the stage game equilibrium. A class of repeated chicken is shown to satisfy the condition.     

Approximate efficiency in repeated games with correlated private signals

This paper presents repeated games with hidden moves, in which players receive imperfect private signals and are able to communicate. We propose a conditional probability approach to solve the learning problem in repeated games with correlated private signals and delayed communication. We then apply this approach to symmetric n-player games to obtain an approximate efficiency result.     

Adaptation and complexity in repeated games

The paper presents a learning model for two-player infinitely repeated games. In an inference step players construct minimally complex inferences of strategies based on observed play, and in an adaptation step players choose minimally complex best responses to an inference. When players randomly select an inference from a probability distribution with full support the set of steady states is a subset of the set of Nash equilibria in which only stage game Nash equilibria are played. When players make ‘cautious’ inferences the set of steady states is the subset of self-confirming equilibria with Nash outcome paths. When players use different inference rules, the set of steady states can lie between the previous two cases.     

A learning-based model of repeated games with incomplete information

This paper tests a learning-based model of strategic teaching in repeated games with incomplete information. The repeated game has a long-run player whose type is unknown to a group of short-run players. The proposed model assumes a fraction of ‘short-run’ players follow a one-parameter learning model (self-tuning EWA). In addition, some ‘long-run’ players are myopic while others are sophisticated and rationally anticipate how short-run players adjust their actions over time and “teach” the short-run players to maximize their long-run payoffs. All players optimize noisily. The proposed model nests an agent-based quantal-response equilibrium (AQRE) and the standard equilibrium models as special cases. Using data from 28 experimental sessions of trust and entry repeated games, including 8 previously unpublished sessions, the model fits substantially better than chance and much better than standard equilibrium models. Estimates show that most of the long-run players are sophisticated, and short-run players become more sophisticated with experience.     

Non-computable strategies and discounted repeated games

Summary A number of authors have used formal models of computation to capture the idea of bounded rationality in repeated games. Most of this literature has used computability by a finite automaton as the standard. A conceptual difficulty with this standard is that the decision problem is not closed. That is, for every strategy implementable by an automaton, there is some best response implementable by an automaton, but there may not exist any algorithm forfinding such a best response that can be implemented by an automaton. However, such algorithms can always be implemented by a Turing machine, the most powerful formal model of computation. In this paper, we investigate whether the decision problem can be closed by adopting Turing machines as the standard of computability. The answer we offer is negative. Indeed, for a large class of discounted repeated games (including the repeated Prisoner's Dilemma) there exist strategies implementable by a Turing machine for whichno best response is implementable by a Turing machine.The work was begun while Nachbar was a visitor at The Center for Mathematical studies in Economics and Management Science at Northwestern University; he is grateful for their hospitality. We are also grateful to Robert Anderson and Neil Gretsky and to seminar audiences at UCLA for useful comments, and to the National Science Foundation and the UCLA Academic Senate Committee on Research for financial support. This paper is an outgrowth of work reported in Learning and Computability in Discounted Supergames.     

Regret minimization in repeated matrix games with variable stage duration

Regret minimization in repeated matrix games has been extensively studied ever since Hannan's seminal paper [Hannan, J., 1957. Approximation to Bayes risk in repeated play. In: Dresher, M., Tucker, A.W., Wolfe, P. (Eds.), Contributions to the Theory of Games, vol. III. Ann. of Math. Stud., vol. 39, Princeton Univ. Press, Princeton, NJ, pp. 97–193]. Several classes of no-regret strategies now exist; such strategies secure a long-term average payoff as high as could be obtained by the fixed action that is best, in hindsight, against the observed action sequence of the opponent. We consider an extension of this framework to repeated games with variable stage duration, where the duration of each stage may depend on actions of both players, and the performance measure of interest is the average payoff per unit time. We start by showing that no-regret strategies, in the above sense, do not exist in general. Consequently, we consider two classes of adaptive strategies, one based on Blackwell's approachability theorem and the other on calibrated play, and examine their performance guarantees. We further provide sufficient conditions for existence of no-regret strategies in this model.     

The value of commitment in contests and tournaments when observation is costly

We study the value of commitment in sequential contests when the follower faces small costs to observe the leader's effort. We show that the value of commitment vanishes entirely in this class of games. By contrast, in sequential tournaments—games where, at a cost, the follower can observe the effectiveness of the leader's effort—the value of commitment is preserved completely provided that the observation costs are sufficiently small.     

An experimental study of commitment in Stackelberg games with observation costs

We report on experiments examining the value of commitment in Stackelberg games where the follower chooses whether to pay some cost to perfectly observe the leader's action. Várdy [Games Econ. Behav. (2004)] shows that in the unique pure-strategy subgame perfect equilibrium of this game, the value of commitment is lost completely; however, there exists a mixed-strategy subgame perfect equilibrium where the value of commitment is fully preserved. In the data, the value of commitment is largely preserved when the cost of looking is small, while it is lost when the cost is large. Nevertheless, for small observation costs, equilibrium behavior is clearly rejected. Instead, subjects persistently play non-equilibrium strategies in which the probability of the follower choosing to observe the leader's action is a decreasing function of the observation cost.     

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.     

Auctions with costly information acquisition

We characterize optimal selling mechanisms in auction environments where bidders must incur a cost to learn their valuations. These mechanisms specify for each period, as a function of the bids in previous periods, which new potential buyers should be asked to bid. In addition, these mechanisms must induce the bidders to acquire information about their valuations and to reveal this information truthfully. Using a generalized Groves principle, we prove a very general “full extraction of the surplus” result: the seller can obtain the same profit as if he had full control over the bidders’ acquisition of information and could have observed directly their valuations once they are informed. We also present appealing implementations of the optimal mechanism in special cases. For helpful comments we thank George Deltas, David Martimort, an anonymous referee, and seminar participants in Mannheim, Rutgers, Tel Aviv, Toulouse, the Society for Economic Design 2002 conference in New York, and the 2003 North American Summer Meetings of the Econometric Society in Evanston, IL. Yossi Spiegel thanks the IIBR for financial assistance and Charles Zheng thanks the NSF for grant SES-0214471.     

Persuasion with communication costs

This paper studies strategic transmission of verifiable information with reporting costs that continuously increase in the precision of the report. Contrary to previous literature, it is shown that the unraveling result first derived by Milgrom (1981) is relatively robust to costly reporting. A separating equilibrium exists even with arbitrarily high reporting costs. Intuitively, the costs work as a signaling device and a combination of disclosure of information and costly signaling accomplishes full separation. With reporting costs there are typically multiple equilibria. For example, a pooling equilibrium exists if and only if the reporting costs are high. Finally, a separating equilibrium exists when the receiver has to make a costly effort in order to access the information in a report, as long as this cost is not too high.     

Coordination failure in repeated games with private monitoring

Players coordinate continuation play in repeated games with public monitoring. We investigate the robustness of such equilibrium behavior with respect to ex-ante small private-monitoring perturbations. We show that with full support of public signals, no perfect public equilibrium is robust if it induces a “regular” 2×2$2\times 2$ coordination game in the continuation play. This regularity condition is violated in all belief-free equilibria. Indeed, with an individual full rank condition, every interior belief-free equilibrium is robust. We also analyze block belief-free equilibria and point out that the notion of robustness is sensitive to whether we allow for uninterpretable signals.     

Communication in repeated monetary policy games

A central bank and the public are engaged in an infinitely repeated monetary policy game with communication. For reasonable discount factors, there exists an equilibrium in which the central bank fully reveals its private information. The fully revealing equilibrium is superior to the uninformative equilibrium. The welfare gain of transparency increases with the slope of the Phillips curve, the natural rate of unemployment, and the degree of heterogeneity in the population. Transparency results in lower inflation but a higher variability of inflation.     

Complementarities and costly investment in a growth model

We develop a one-sector growth model whose key aspect is the combination of the assumptions of internal costly investment in capital and complementarities between capital goods in the production function. Despite the nonlinearity generated by these assumptions, the model delivers a single equilibrium.