Coordination and Information in Critical Mass Games: An Experimental Study

We present experimental results on a repeated coordination game with Pareto-ranked equilibria in which a payoff from choosing an action is positive only if a critical mass of players choose that action. We design a baseline version of the game in which payoffs remain constant for values above the critical mass, and an increasing returns version in which payoffs keep increasing for values above the critical mass. We test the predictive power of security and payoff-dominance under different information treatments. Our results show that convergence to the payoff-dominant equilibrium is the modal limit outcome when players have full information about others' previous round choices, while this outcome never occurs in the remaining treatments. The paths of play in some groups reveal a tacit dynamic coordination by which groups converge to the efficient equilibrium in a step-like manner. Moreover, the frequency and speed of convergence to the payoff-dominant equilibrium are higher, ceteris paribus, when increasing returns are present. Finally, successful coordination seems to crucially depend on players' willingness to signal to others the choice of the action supporting the efficient equilibrium.     

Routines and incentives in group tasks*

The artificial context “Target the Two” has been used in experiments to explore some of the features of routinization and learning. Two agents must learn to coordinate their actions to achieve a common goal, without being allowed to use verbal communication. This article reports an experiment, in which we compare the degree of routinization and the performance of players in two treatments. Each treatment submits players to the same sequence of starting configurations, but differs in terms of the payoff function. In the first treatment (A), the payoff is based on the number of moves required to achieve the goal, whereas in the second treatment (B) the payoff depends on the time required for completion. We observe that (1) in treatment B subjects tend to play in a more “routinized” way and (2) treatment B reduces the time spent on play, but does not decrease the resources (the number of moves) used, relative to treatment A.     

Rational conjectures and evolutionary beliefs in public goods games

This paper applies conjectural variations (CVs) to a model of public good provision and shows that CVs are superior to Nash beliefs. In addition to imposing consistency, as Bresnahan, I show that consistent conjectures (CCs) are obtained from individual payoff maximization. CCs emerge as the unique subgame perfect Nash equilibrium (NE) in a two-stage game in which beliefs are chosen in Stage 1 and quantities in Stage 2. There is an individual payoff advantage to non-Nash behavior, generating a Prisoner's Dilemma in conjectures in addition to the usual free-rider problem associated with public goods. The correct and payoff maximizing conjecture is the unique equilibrium in an evolutionary framework against a player with Nash conjectures. The consistent conjecture equilibrium is the unique evolutionary equilibrium when both players conjectures evolve. Hence, the NE prediction is too optimistic when players have rational conjectures.     

Evolution of harvesting strategies: replicator and resource dynamics

Abstract. Economic theories of managing renewable resources, such as fisheries and forestry, traditionally assume that individual harvesters are perfectly rational and thus able to compute the harvesting strategy that maximizes their discounted profits. The current paper presents an alternative approach based on bounded rationality and evolutionary mechanisms. It is assumed that individual harvesters face a choice between two harvesting strategies. The evolution of the distribution of strategies in the population is modeled through a replicator dynamics equation. The latter captures the idea that strategies yielding above average profits are demanded more than strategies yielding below average profits, so that the first type ends up accounting for a larger part in the population. From a mathematical perspective, the combination of resource and evolutionary processes leads to complex dynamics. The paper presents the existence and stability conditions for each steady-state of the system and analyzes dynamic paths to the equilibrium. In addition, effects of changes in prices are analyzed. A main result of the paper is that under certain conditions both strategies can survive in the long-run. Correspondence to: J. Noailly     

A “Super” Folk Theorem for dynastic repeated games

We analyze dynastic repeated games. These are repeated games in which the stage game is played by successive generations of finitely-lived players with dynastic preferences. Each individual has preferences that replicate those of the infinitely-lived players of a standard discounted infinitely-repeated game. Individuals live one period and do not observe the history of play that takes place before their birth, but instead create social memory through private messages received from their immediate predecessors. Under mild conditions, when players are sufficiently patient, all feasible payoff vectors (including those below the minmax of the stage game) can be sustained by sequential equilibria of the dynastic repeated game with private communication. In particular, the result applies to any stage game with n  ≥  4 players for which the standard Folk Theorem yields a payoff set with a non-empty interior. We are also able to characterize fully the conditions under which a sequential equilibrium of the dynastic repeated game can yield a payoff vector not sustainable as a subgame perfect equilibrium of the standard repeated game. For this to be the case it must be that the players’ equilibrium beliefs violate a condition that we term “inter-generational agreement.” A previous version of this paper was circulated as Anderlini et al. (2005). We are grateful to Jeff Ely, Leonardo Felli, Navin Kartik, David Levine, Stephen Morris, Michele Piccione, Andrew Postlewaite, Lones Smith and to seminar audiences at Bocconi, Cambridge, CEPR-Guerzensee, Chicago, Columbia, Edinburgh, Essex, Georgetown, Leicester, LSE, Northwestern, Oxford, Rome (La Sapienza), Rutgers, SAET-Vigo, Stanford, SUNY-Albany, UCL, UC-San Diego, Venice and Yale for helpful feedback.     

Sowing Doubt Optimally in Two-Person Repeated Games

Consider a two-person repeated game, where one of the players, P1, can sow doubt, in the mind of his opponent, as to what P1's payoffs are. This results in a two-person repeated game with incomplete information. By sowing doubt, P1 can sometimes increase his minimal equilibrium payoff in the original game. We prove that this minimum is maximal when only one payoff matrix, the negative of the payoff matrix of the opponent, is added (the opponent thus believes that he might play a zero-sum game). We obtain two formulas for calculating this maximal minimum payoff. Journal of Economic Literature Classification Numbers: C7, D8.     

Destruction and settlement norms as determinants of conflict: An evolutionary perspective

This paper studies conflict in a simple bargaining framework using an evolutionary game-theoretic approach. Our findings suggest that a player does not always regard the winning probability as an acceptable settlement rule. He accepts a division according to winning probability when the destruction caused to him in conflict is more than a threshold, which in turn depends on cost of conflict to the opponent and the size of the population. Further, our analysis shows that the norms with positive weight to disagreement payoff are effective against conflict, and incentivize peace. Contrary to the findings of extant studies carried out in finite population evolutionary game setting, the settlement possibility set is identical under both ESS and Nash equilibrium in our model with settlement norms.     

N-PERSON NASH BNARGAINING WITH VARIABEL THREATS*

We consider two models of n-person bargaining problems with the endogenous determination of disagreement points. In the first model, which is a direct extension of Nash's variable threat bargaining model, the disagreement point is determined as an equilibrium threat point. In the second model, the disagreement point is given as a Nash equilibrium of the underlying noncooperative game. These models are formulated as extensive games, and axiomatizations of solutions are given for both models. It is argued that for games with more than two players, the first bargaining model does not preserve some important properties valid for two-person games, e.g., the uniqueness of equilibrium payoff vector. We also show that when the number of players is large, any equilibrium threat point becomes approximately a Nash equilibrium in the underlying noncooperative game, and vice versa. This result suggests that the difference between the two models becomes less significant when the number of players is large.     

A differentiable homotopy to compute Nash equilibria of n-person games

Summary. The literature on the computation of Nash equilibria in n-person games is dominated by simplicial methods. This paper is the first to introduce a globally convergent algorithm that fully exploits the differentiability present in the problem. It presents an everywhere differentiable homotopy to do the computations. The homotopy path can therefore be followed by several numerical techniques. Moreover, instead of computing some Nash equilibrium, the algorithm is constructed in such a way that it computes the Nash equilibrium selected by the tracing procedure of Harsanyi and Selten. As a by-product of our proofs it follows that for a generic game the tracing procedure defines a unique feasible path. The numerical performance of the algorithm is illustrated by means of several examples. Received: December 21, 1999; revised version: December 27, 2000     

Payoff dominance and risk dominance in the observable delay game: a note

We examine whether the payoff dominant sequential-move (Stackelberg) outcome is realized when timing is endogenized. We adopt the observable delay game formulated by Hamilton and Slutsky [Games Econ Behav 2(1):29–46, 1990]. We find that if one sequential-move outcome is payoff dominant, either (i) the outcome both players prefer is the unique equilibrium; or (ii) two sequential-move outcomes are equilibria and the one both players prefer is risk dominant. In other words, no conflict between payoff dominance and risk dominance in the observable delay game exists, in contrast to other games such as (non pure) coordination games. We also find that even if one of two sequential-move outcomes is the unique equilibrium outcome in the observable delay game, it does not imply that the equilibrium outcome is payoff dominant to the other sequential-move outcome.      

A game of timing and visibility

We consider the following abstraction of competing publications. There are n players in the game. Each player i chooses a point x_i in the interval [0,1], and a player's payoff is the distance from its point x_i to the next larger point, or to 1 if x_i is the largest. For this game, we give a complete characterization of the Nash equilibrium for the two-player game, and, more important, we give an efficient approximation algorithm to compute numerically the symmetric Nash equilibrium for the n-player game. The approximation is computed via a discrete version of the game. In both cases, we show that the (symmetric) equilibrium is unique. Our algorithmic approach to the n-player game is non-standard in that it does not involve solving a system of differential equations. We believe that our techniques can be useful in the analysis of other timing games.     

A decomposition algorithm for N-player games

An N-player game can be decomposed by adding a coordinator who interacts bilaterally with each player. The coordinator proposes profiles of strategies to the players, and his payoff is maximized when players’ optimal replies agree with his proposal. When the feasible set of proposals is finite, a solution of an associated linear complementarity problem yields an equilibrium of the approximate game and thus an approximate equilibrium of the original game. Computational efficiency is improved by using vertices of a triangulation of the players’ strategy space for the coordinator’s pure strategies. Computational experience is reported.     

Endogenous fluctuations in the demand for education

Abstract. Enrollment rates to higher education reveal a quite large variation over time which cannot be explained by productivity shocks alone. We develop a human capital investment model in an overlapping generations framework that features endogenous fluctuations in the demand for education. Agents are heterogeneous in their beliefs about future wage differentials. An evolutionary competition between the heterogeneous beliefs determines the fraction of the newborn generation having a certain belief. Costly access to information on the returns to education induces agents to use potentially destabilizing backward looking prediction rules. Only if previous generations experience regret about their human capital investment decisions, will agents choose a more sophisticated prediction rule that dampens the cycle. Access to information becomes key for stable flows to higher education. RID="*" ID="*"We would like to thank Cars Hommes, Florian Wagener, seminar participants at the University of Amsterdam, participants of the workshop on ‘Skill Needs and Labor Market Dynamics’ at the Wissenschaftszentrum Berlin für Sozialforschung (WZB) for helpful discussions, and an editor of this Journal and three anonymous referees for their comments. Tuinstra's research is supported by the Netherlands Organisation for Scientific Research (NWO) under a MaG-Pionier grant. Neugart acknowledges financial support from the German Ministry of Education. Parts of the research were done while Tuinstra was visiting the WZB and when Neugart was visiting CeNDEF. Correspondence to: The research for this paper was done while the first author was affiliated with the Wissenschaftszentrum Berlin für Sozialforschung.     

Bertrand–Edgeworth Duopoly with Buyouts or First Refusal Contracts

In this game the players are firms involved in a Bertrand–Edgeworth duopoly market. Payoffs to the low priced firm depend only on the own price, whereas the payoff to the high priced firm depends on both its own price and the price of the opponent. The price of the opponent enters the payoff function of the high priced firm through buyout or a first refusal contract. Only when the total capacity in the market is less than the output in a monopoly situation, there is an equilibrium in pure strategies.Journal of Economic LiteratureClassification Numbers: C72, D43, L12.     

An evolutionary theory of the convergence towards low inflation rates

This paper presents an evolutionary interpretation of Barro-Gordons monetary policy game. The model describes a multi-country setup where governments and private agents are boundedly rational players. The behavioral rule of players decisions leads to the imitation of the strategy giving the highest payoff. In this evolutionary monetary policy game, we show how a low inflation state is reached from an international context dominated by inflationary policies. The analysis explains the convergence towards low inflation rates observed during the past twenty years. Moreover, the low inflation state appears to be the long-run equilibrium of the game under some conditions featuring the observed macroeconomic context.JEL Classification: E5, C72, C73 Correspondence to: A. dArtigues     

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.     

Repeated games with present-biased preferences

We study infinitely repeated games with perfect monitoring, where players have β-δ preferences. We compute the continuation payoff set using recursive techniques and then characterize equilibrium payoffs. We then explore the cost of the present-time bias, producing comparative statics. Unless the minimax outcome is a Nash equilibrium of the stage game, the equilibrium payoff set is not monotonic in β or δ. Finally, we show how the equilibrium payoff set is contained in that of a repeated game with smaller discount factor.     

When will payoff maximization survive? An indirect evolutionary analysis

Survival of payoff maximization is the usual as if-justification for assuming rational economic agents. An indirect evolutionary analysis allows for stimuli which are not directly related to reproductive success although they affect behavior. One first determines the solution for all possible constellations of stimuli, and then the evolutionarily stable stimuli. Our general analysis confirms the special results of former studies that payoff maximization in case of commonly known stimuli requires either that own success does not depend on other's behavior or that other's behavior is not influenced by own stimuli. When stimuli are private information, one can derive similar necessary conditions.     

Competition and coordination in experimental minority games

This work presents experimental results on a coordination game in which agents must repeatedly choose between two sides, and a positive fixed payoff is assigned only to agents who pick the minoritarian side. We conduct laboratory experiments in which stationary groups of five players play the game for 100 periods, and manipulate two treatment variables: the amount of information about other players’ past choices and the salience of information regarding the game history (i.e., the length of the string of past outcomes that players can see on the screen while choosing). Our main findings can be summarized as follows: aggregate efficiency in the game is in most cases significantly higher than the level corresponding to the symmetric mixed strategy Nash equilibrium. In addition, providing players with information about individual choices in the group does not improve aggregate efficiency with respect to when such information is absent. Displaying information about more rounds than just the previous one, on the other hand, seems to have a positive effect on aggregate efficiency. At the individual level, we find a stronger statistical relation between players’ current choices and their own past choices than between players’ choices and previous aggregate outcomes. In addition, the depth of the relation between present and past choices seems to be affected by the prompt availability of information about the game history. Finally, we detect evidence of a mutual co-adaptation between players’ choices over time that is partly responsible for the high level of efficiency observed.      

UNIQUENESS OF EQUILIBRIUM PAYOFFS IN FINITELY REPEATED GAMES WITH IMPERFECT MONITORING*

This paper examines when a finitely repeated game with imperfect monitoring has a unique equilibrium payoff vector. This problem is nontrivial under imperfect monitoring, because uniqueness of equilibrium (outcome) in the stage game does not extend to finitely repeated games. A (correlated) equilibrium is equilibrium minimaxing if any player's equilibrium payoff is her minimax value when the other players choose a correlated action profile from the actions played in the equilibrium. The uniqueness result holds if all stage game correlated equilibria are equilibrium minimaxing and have the same payoffs. The uniqueness result does not hold under weaker conditions.