The optimal degree of cooperation in the repeated Prisoners' Dilemma with side payments

In the infinitely repeated Prisoners' Dilemma with side payments, we characterize the Pareto frontier of the set of subgame perfect equilibrium payoffs for all possible combinations of discount factors. Play paths implementing Pareto dominant equilibrium payoffs are uniquely determined in all but the first period. Full cooperation does not necessarily implement these payoffs even when it maximizes total stage game payoffs. Rather, when the difference in players' discount factors is sufficiently large, Pareto dominant equilibrium payoffs are implemented by partial cooperation supported by repeated payments from the impatient to the patient player. When both players are sufficiently patient, such payoffs, while implemented via full cooperation, are supported by repeated payments from the impatient to the patient player. We characterize conditions under which public randomization has no impact on the Pareto dominant equilibrium payoffs and conditions under which such payoffs are robust to renegotiation.     

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.     

Strategic Buyers and Privately Observed Prices

A model of finitely repeated price competition between two sellers with differentiated goods and a large buyer is analyzed. The set of pure strategy sequential equilibria is investigated under public and private monitoring. With private monitoring, i.e., when prices are not observable to the competing sellers, all sales are made by the better seller and the set of repeated game equilibrium payoffs coincides with the stage game subgame perfect equilibrium payoffs. This is in sharp contrast to the game with perfect monitoring where the folk theorem obtains. Journal of Economic Literature Classification Numbers: C72, D43.     

On the voluntary provision of “weakest‐link” public goods: The case of private information

We characterize equilibria in a private‐provision public‐good game where individuals are allowed arbitrary contribution levels and the level of the public good equals the least contribution made by an individual. Equilibrium comparative statics are derived for the interim Pareto‐dominant equilibrium. First, improvements in the cost distribution of even only one player benefit all. Second, even with such “weakest‐link” public goods, for which greater similarity of preferences would seem to facilitate coordination, decreased heterogeneity can actually decrease payoffs. Indeed, increasing the riskiness of cost distributions has an ambiguous effect on welfare. Two mechanisms are provided for improving equilibrium payoffs: Technology transfer and cheap‐talk communication. While substantial welfare gains are possible, examples show that (a) technology transfer may be futile if a “regularity” condition is not satisfied and (b) cheap talk may be useless if the language for communication is not sufficiently rich.     

Communication, correlation and cheap-talk in games with public information

This paper studies extensive form games with public information where all players have the same information at each point in time. We prove that when there are at least three players, all communication equilibrium payoffs can be obtained by unmediated cheap-talk procedures. The result encompasses repeated games and stochastic games.     

A folk theorem for Bayesian games with commitment

The set of all Bayesian–Nash equilibrium payoffs that the players can achieve by making conditional commitments at the interim stage of a Bayesian game coincides with the set of all feasible, incentive compatible and interim individually rational payoffs of the Bayesian game. Furthermore, the various equilibrium payoffs, which are achieved by means of different commitment devices, are also the equilibrium payoffs of a universal, deterministic commitment game.     

Selecting equilibria in common agency games

We characterize equilibrium payoffs of a delegated common agency game in a public good context where principals use smooth contribution schedules. We prove that under complete information, payoff vectors of equilibria with truthful schedules coincide with the set of smooth equilibrium payoffs, including non-truthful schedules. We next consider whether the presence of arbitrarily small amounts of asymmetric information is enough to refine this payoff set. Providing that the extensions of the equilibrium schedules beyond the equilibrium point are flatter than truthful schedules, the set of equilibrium payoffs is strictly smaller than the set of smooth (equivalently, truthful) equilibrium payoffs. Interestingly, some forms of asymmetric information do not sufficiently constrain the slopes of the extensions and fail to refine the payoff set. In the case of a uniform distribution of types and arbitrary out-of-equilibrium contributions, the refinement has no bite. If, however, one restricts out-of-equilibrium behavior in a natural way, the refinement is effective. Alternatively, we may consider an exponential distribution with unbounded support (and hence no out-of-equilibrium choices) and we find that the refinement selects a unique equilibrium payoff vector equal to Lindahl prices.As a separate contribution, equilibria with forcing contracts are also considered both under complete and asymmetric information.     

Collusion as public monitoring becomes noisy: Experimental evidence

This paper uses laboratory experiments to test the implications of the theory of repeated games on equilibrium payoffs and estimate strategies in an infinitely repeated prisoners' dilemma game with imperfect public monitoring. We find that subjects' payoffs (i) decrease as noise increases, and (ii) are lower than the theoretical maximum for low noise, but exceed it for high noise. Under the assumption that the subjects' strategy uses thresholds on the public signal for transition between cooperation and punishment states, we find that the best fitting strategy simply compares the most recent public signal against a single threshold.     

Efficiency and stability of sampling equilibrium in public goods games

Most models of social preferences and bounded rationality that are effective in explaining efficiency‐increasing departures from equilibrium behavior cannot easily account for similar deviations when they are efficiency‐reducing. We show that the notion of sampling equilibrium, subject to a suitable stability refinement, can account for behavior in both efficiency‐enhancing and efficiency‐reducing conditions. In particular, in public goods games with dominant strategy equilibria, stable sampling equilibrium can involve the play of dominated strategies with positive probability both when such behavior increases aggregate payoffs (relative to the standard prediction) and when it reduces aggregate payoffs. The dominant strategy equilibrium prediction changes abruptly from zero contribution to full contribution as a parameter crosses a threshold, whereas the stable sampling equilibrium remains fully mixed throughout. This is consistent with the available experimental evidence.     

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.     

Restricted feedback in long term relationships

This paper studies long term relationships, modeled as repeated games, with restricted feedback. Players condition current play on summary statistics of past play rather than the entire history, as may be the case in online markets. Our state strategy equilibrium framework allows for arbitrary restrictions on strategies. We derive a recursive characterization for the set of equilibrium payoffs similar to that of Abreu, Pearce, and Stacchetti (1986, 1990) [2], [3] for perfect public equilibria and show that the set of equilibrium payoffs is the largest fixed point of a monotone operator. We use our characterization to derive necessary and sufficient conditions for efficient trade in a repeated product choice game where costumers condition their purchase decisions only on the last performance signal.     

Noisy Directional Learning and the Logit Equilibrium

We specify a dynamic model in which agents adjust their decisions toward higher payoffs, subject to normal error. This process generates a probability distribution of players’ decisions that evolves over time according to the Fokker–Planck equation. The dynamic process is stable for all potential games, a class of payoff structures that includes several widely studied games. In equilibrium, the distributions that determine expected payoffs correspond to the distributions that arise from the logit function applied to those expected payoffs. This “logit equilibrium” forms a stochastic generalization of the Nash equilibrium and provides a possible explanation of anomalous laboratory data.     

Repeated games with one-memory

We study the extent to which equilibrium payoffs of discounted repeated games can be obtained by 1-memory strategies. We establish the following in games with perfect (rich) action spaces: First, when the players are sufficiently patient, the subgame perfect Folk Theorem holds with 1-memory. Second, for arbitrary level of discounting, all strictly enforceable subgame perfect equilibrium payoffs can be approximately supported with 1-memory if the number of players exceeds two. Furthermore, in this case all subgame perfect equilibrium payoffs can be approximately supported by an ε-equilibrium with 1-memory. In two-player games, the same set of results hold if an additional restriction is assumed: Players must have common punishments. Finally, to illustrate the role of our assumptions, we present robust examples of games in which there is a subgame perfect equilibrium payoff profile that cannot be obtained with 1-memory. Thus, our results are the best that can be hoped for.     

On the limit perfect public equilibrium payoff set in repeated and stochastic games

This paper provides a dual characterization of the existing ones for the limit set of perfect public equilibrium payoffs in a class of finite stochastic games (in particular, repeated games) as the discount factor tends to one. As a first corollary, the folk theorems of Fudenberg et al. (1994), Kandori and Matsushima (1998) and Hörner et al. (2011) obtain. As a second corollary, it is shown that this limit set of payoffs is a convex polytope when attention is restricted to perfect public equilibria in pure strategies. This result fails for mixed strategies, even when attention is restricted to two-player repeated games.     

Learning from private information in noisy repeated games

We study the perfect type-contingently public ex-post equilibrium (PTXE) of repeated games where players observe imperfect public signals of the actions played, and both the payoff functions and the map from actions to signal distributions depend on an unknown state. The PTXE payoffs when players are patient are determined by the solutions to a family of linear programming problems. Using this characterization, we develop conditions under which play can be as if the players have learned the state. We provide a sufficient condition for the folk theorem, and a characterization of the PTXE payoffs in games with a known monitoring structure.     

Group efforts when performance is determined by the “best shot”

We investigate the private provision of a public good whose level is determined by the maximum effort made by a group member. Costs of effort are either commonly known or privately known. For symmetric perfect-information games, any number of players may be active and we characterize the unique (mixed-strategy) equilibrium in which active contributors use the same strategy. Increasing the number of active players leads to stochastically lower individual efforts and level of the public good. When information is private, the symmetric equilibrium is in pure strategies. Increasing the number of players yields a pointwise reduction in the equilibrium contribution strategy but an increase in equilibrium payoffs. Comparative statics with respect to costs and levels of risk aversion are derived. Finally, whether information is public or private, equilibria are inefficient—we provide mechanisms that improve efficiency.     

Discontinuous Payoffs, Shared Resources, and Games of Fiscal Competition: Existence of Pure Strategy Nash Equilibrium

We define a class of games with discontinuous payoffs that we call shared resource games and establish a pure strategy Nash equilibrium existence theorem for these games. We then apply this result to a canonical game of fiscal competition for mobile capital. Other applications are also discussed. Our result for the mobile capital game holds for any finite number of regions, permits general preferences over private and public goods, and does not assume that production technologies have a particular functional form, or are identical in all regions, or satisfy the Inada condition at zero.     

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.     

Economies with Land—A Game Theoretical Approach

With an economy with land (an economy of Debreu-type in which land is the unique commodity) we associate a cooperative game with transferable utility v . The set of all TU-games of type v is investigated and the set of equilibrium payoffs (in the TU-sense) of the economy is described as a subset of the core of v . We prove that equilibrium payoffs can be extended to population monotonic allocation schemes in the sense of Sprumont.     

Communication in repeated games with costly monitoring

We study repeated games with discounting where perfect monitoring is possible, but costly. It is shown that if players can make public announcements, then every payoff vector which is an interior point in the set of feasible and individually rational payoffs can be implemented in a sequential equilibrium of the repeated game when the discount factor is high enough. Thus, efficiency can be approximated even when the cost of monitoring is high, provided that the discount factor is high enough.