Cooperative behavior and the frequency of social interaction

We report results from an experiment that examines play in an indefinitely repeated, two-player Prisoner's Dilemma game. Each experimental session involves N subjects and a sequence of indefinitely repeated games. The main treatment consists of whether agents are matched in fixed pairings or matched randomly in each indefinitely repeated game. Within the random matching treatment, we elicit player's strategies and beliefs or vary the information that players have about their opponents. Contrary to a theoretical possibility suggested by Kandori [1992. Social norms and community enforcement. Rev. Econ. Stud. 59, 63–80], a cooperative norm does not emerge in the treatments where players are matched randomly. On the other hand, in the fixed pairings treatment, the evidence suggests that a cooperative norm does emerge as players gain more experience.     

Endogenous transfers in the Prisoner's Dilemma game: An experimental test of cooperation and coordination

We test a two-stage compensation mechanism for promoting cooperation in Prisoner's Dilemma games. Players first simultaneously choose binding non-negative amounts to pay their counterparts for cooperating, and then play the induced game knowing these amounts. In our games, all payment pairs consistent with mutual cooperation in subgame-perfect equilibrium transform these games into coordination games, with both mutual cooperation and mutual defection as Nash equilibria in the second stage. When endogenous transfer payments are not permitted, cooperation is much less likely. Mutual cooperation is most likely when the (sufficient) payments are identical, and it is also substantially more likely with payment pairs that bring the mutual-cooperation payoffs closer together. Both the Fehr–Schmidt and Charness–Rabin models predict that transfers that make final payoffs closer are preferred; however, they do not explain why equal transfers are particularly effective. Transfers are also effective in sustaining cooperation even when they are imposed and not chosen.     

Equilibrium selection in similar repeated games: experimental evidence on the role of precedents

We report on an experiment examining behavior and equilibrium selection in two similar, infinitely repeated games, Stag Hunt and Prisoner’s Dilemma under anonymous random matching. We are interested in the role that historical precedents may play for equilibrium selection between these two repeated games. We find that a precedent for efficient play in the repeated Stag Hunt game does not carry over to the repeated Prisoner’s Dilemma game despite the possibility that efficient play can be sustained as an equilibrium of the indefinitely repeated game. Similarly, a precedent for inefficient play in the repeated Prisoner’s Dilemma game does not extend to the repeated Stag Hunt game. We conclude that equilibrium selection between similar repeated games may have less to do with historical precedents and might instead depend more on strategic considerations associated with the different payoffs of these similar repeated games.     

On the size and structure of group cooperation

When time preferences are heterogeneous and bounded away from one, how “much” cooperation can be achieved by an ongoing group? How does group cooperation vary with the group's size and structure? This paper examines characteristics of cooperative behavior in the class of symmetric, repeated games of collective action. These are games characterized by “free rider problems” in the level of cooperation achieved. The Repeated Prisoner's Dilemma games is a special case.We characterize the level of maximal average cooperation (MAC), the highest average level of cooperation, over all stationary subgame perfect equilibrium paths, that the group can achieve. The MAC is shown to be increasing in monotone shifts, and decreasing in mean preserving spreads of the distribution of discount factors. The latter suggests that more heterogeneous groups are less cooperative on average. Finally, in a class of Prisoner's Dilemma games, we show under weak conditions that the MAC exhibits increasing returns to scale in a range of heterogeneous discount factors. That is, larger groups are more cooperative, on average, than smaller ones. By contrast, when the group has a common discount factor, the MAC is invariant to group size.     

Bounding the inefficiency of equilibria in nonatomic congestion games

Equilibria in noncooperative games are typically inefficient, as illustrated by the Prisoner's Dilemma. In this paper, we quantify this inefficiency by comparing the payoffs of equilibria to the payoffs of a “best possible” outcome. We study a nonatomic version of the congestion games defined by Rosenthal [Int. J. Game Theory 2 (1973) 65], and identify games in which equilibria are approximately optimal in the sense that no other outcome achieves a significantly larger total payoff to the players—games in which optimization by individuals approximately optimizes the social good, in spite of the lack of coordination between players. Our results extend previous work on traffic routing games.     

Evolving Aspirations and Cooperation

A 2×2 game is played repeatedly by two satisficing players. The game considered includes the Prisoner's Dilemma, as well as games of coordination and common interest. Each player has anaspirationat each date, and takes an action. The action is switched at the subsequent period only if the achieved payoff falls below aspirations; the switching probability depends on the shortfall. Aspirations are periodically updated according to payoff experience, but are occasionally subject to trembles. For sufficiently slow updating of aspirations and small tremble probability, it is shown that both players must ultimately cooperate most of the time.Journal of Economic LiteratureClassification Numbers C72, D83.     

Self-admissible sets

Best-response sets (Pearce, 1984 [28]) characterize the epistemic condition of “rationality and common belief of rationality.” When rationality incorporates a weak-dominance (admissibility) requirement, the self-admissible set (SAS) concept (Brandenburger, Friedenberg, and Keisler, 2008 [17]) characterizes “rationality and common assumption of rationality.” We analyze the behavior of SAS's in some games of interest—Centipede, the Finitely Repeated Prisoner's Dilemma, and Chain Store. We then establish some general properties of SAS's, including a characterization in perfect-information games.     

Oligopolistic Trade and Competition in Wages Legislations

Wages legislation, or selective enforcement of such legislation, may be used to enhance the competitiveness of domestic firms. We show that, if domestic and foreign firms produce close substitutes and are Bertrand rivals, then wages legislation and enforcement display the characteristics of a Prisoner's Dilemma game. Other scenarios are also investigated.
JEL Classification: F13     

The Repeated Prisoner's Dilemma with Imperfect Private Monitoring

In this paper, I study a repeated Prisoner's Dilemma game in which monitoring is private and imperfect. A partial folk theorem is proved for the case of almost perfect monitoring.     

Voluntarily Separable Repeated Prisoner's Dilemma

Ordinary repeated games do not apply to real societies where one can cheat and escape from partners. We formulate a model of endogenous relationships that a player can unilaterally end and start with a randomly assigned new partner with no information flow. Focusing on two-person, two-action Prisoner's Dilemma, we show that the endogenous duration of partnerships generates a significantly different evolutionary stability structure from ordinary random matching games. Monomorphic equilibria require initial trust building, while a polymorphic equilibrium includes earlier cooperators than any strategy in monomorphic equilibria and is thus more efficient. This is due to the non-linearity of average payoffs.     

When a Precedent of Donation Favors Defection in the Prisoner's Dilemma

Abstract. In this paper, we examine the question of whether a collective activity can influence cooperation in a subsequent repeated one‐shot prisoner's dilemma (PD) game. We conduct two series of experiments. The first consists of control experiments in which 30 periods of a PD game are played, with a random rematching of the pairs in every period. In a second series of experiments, subjects first play a donation game (DG) and then the PD game. In the DG, they collectively discuss the amount of a donation to a given charity, before putting the question to an individual and anonymous vote. Cooperation levels in the PD games preceded by the DG are significantly lower than those observed in the control experiment.     

个体异质性与公共物品治理的关系研究

公共物品治理如何摆脱囚徒困境?研究者试图通过建立数理模型讨论个体异质性对公共物品治理成功的作用。梳理了个体异质性与公共物品治理的关系研究思路,基于前人的相关理论模型和实证工作,给出了公共物品治理中如何将个体间异质性纳入形式化讨论、并用经验现实予以检验的一个展望。     

Order of Play, Forward Induction, and Presentation Effects in Two-Person Games

We investigate the effects of order-of-play (simultaneous, unobserved sequential and fully observed sequential play) and form of presentation (extensive vs. normal) in three simple two person games: battle-of-the-sexes with and without outside option and a three strategy game which differentiates between virtual observability (VO) and iterated elimination of dominated strategies as principles of equilibrium selection. VO predicts that knowledge of the order of play alone will affect the distribution of strategies chosen. We contrast this with the predictions of iterated elimination of dominated strategies. We report results from 1800 one-shot games conducted in 6 sessions with 120 subjects and analysed as panel data. The form of presentation strongly affects the distribution of outcomes and strategies. Information about order of play shifts the distribution of strategies away from the distribution in simultaneous play and towards the distribution in fully observed play, especially in the less complicated games presented in normal order. Order-of-play effects are less evident as complexity of the game increases. Extensive form presentation appears to induce sequential thinking even in simultaneously played games.     

Cooperation in an Overlapping Generations Experiment

Recent theoretical work shows that folk theorems can be developed for infinite overlapping generations games. Cooperation in such games can be sustained as a Nash equilibrium. But, of course, there are other equilibria. This paper investigates experimentally whether cooperation actually occurs in a simple overlapping generations game. Subjects both play the game and formulate strategies. Our main finding is that subjects fail to exploit the intertemporal structure of the game. Even when we provided subjects with a recommendation to play the grim trigger strategy, most of the subjects still employed safe history-independent strategies. Journal of Economic Literature Classification Numbers: C72, C92, D90.     

Equilibrium play and best response to (stated) beliefs in normal form games

We report experimental results on a series of ten one-shot two-person 3×3 normal form games with unique equilibrium in pure strategies played by non-economists. In contrast to previous experiments in which game theory predictions fail dramatically, a majority of actions taken coincided with the equilibrium prediction (70.2%) and were best-responses to subjects' stated beliefs (67.2%). In constant-sum games, 78% of actions taken were predicted by the equilibrium model, outperforming simple K-level reasoning models. We discuss how non-trivial game characteristics related to risk aversion, efficiency concerns and social preferences may affect the predictive value of different models in simple normal form games.     

The Sequential Prisoner's Dilemma: Evidence on Reciprocation

We investigate how fairness concerns influence individual behaviour in social dilemmas. Using a Sequential Prisoner's Dilemma experiment we analyse the extent to which co-operation is conditional on first-mover co-operation, repetition, economic incentives, subject pool (United Kingdom vs. United States) and gender. We find the most important variable influencing co-operation is the first-mover's choice, supporting the argument that co-operative behaviour in social dilemmas reflects reciprocation rather than unconditional altruism. However, we also find that co-operation decreases with repetition, and reciprocation falls as its material cost rises.     

Characterising equilibrium selection in global games with strategic complementarities

Global games are widely used to predict behaviour in games with strategic complementarities and multiple equilibria. We establish two results on the global game selection. First, we show that, for any supermodular complete information game, the global game selection is independent of the payoff functions chosen for the game?s global game embedding. Second, we give a simple sufficient criterion to derive the selection and establish noise independence in many-action games by decomposing them into games with smaller action sets, to which we may often apply simple criteria. We also report in which small games noise independence may be established by counting the number of players or actions.     

Modeling finitely-repeated games with uncertain termination

A supergame is modeled in which two agents play a game repeatedly and while the finiteness of the repetitions is common knowledge, the number of repetitions is not. Such games can yield non-standard results. This is illustrated with the Prisoner's Dilemma where a cooperative outcome is shown to be possible.     

Iterated regret minimization: A new solution concept

For some well-known games, such as the Traveler?s Dilemma or the Centipede Game, traditional game-theoretic solution concepts—most notably Nash equilibrium—predict outcomes that are not consistent with empirical observations. We introduce a new solution concept, iterated regret minimization, that exhibits the same qualitative behavior as that observed in experiments in many games of interest, including Traveler?s Dilemma, the Centipede Game, Nash bargaining, and Bertrand competition. As the name suggests, iterated regret minimization involves the iterated deletion of strategies that do not minimize regret.     

Equilibrium play in matches: Binary Markov games

We study two-person extensive form games, or “matches,” in which the only possible outcomes (if the game terminates) are that one player or the other is declared the winner. The winner of the match is determined by the winning of points, in “point games.” We call these matches binary Markov games. We show that if a simple monotonicity condition is satisfied, then (a) it is a Nash equilibrium of the match for the players, at each point, to play a Nash equilibrium of the point game; (b) it is a minimax behavior strategy in the match for a player to play minimax in each point game; and (c) when the point games all have unique Nash equilibria, the only Nash equilibrium of the binary Markov game consists of minimax play at each point. An application to tennis is provided.