Expectations and optimal monetary policy: A stability problem revisited

A landmark result in the optimal monetary policy design literature is that fundamental-based interest rate rules invariably lead to rational expectations equilibria (REE) that are not stable under adaptive learning. In this paper, we make a novel information assumption that private agents cannot observe aggregate fundamental shocks, and use simple linear forecasting rules for learning. We find that with fundamental-based rules, there exist limited information equilibria that are stable under learning. Moreover, there are multiple equilibria. Learning can be used as a selection tool to identify a unique equilibrium.     

Sequential equilibrium in monotone games: A theory-based analysis of experimental data

A monotone game is an extensive-form game with complete information, simultaneous moves and an irreversibility structure on strategies. It captures a variety of situations in which players make partial commitments and allows us to characterize conditions under which equilibria result in socially desirable outcomes. However, since the game has many equilibrium outcomes, the theory lacks predictive power. To produce stronger predictions, one can restrict attention to the set of sequential equilibria, or Markov equilibria, or symmetric equilibria, or pure-strategy equilibria. This paper explores the relationship between equilibrium behavior in a class of monotone games, namely voluntary contribution games, and the behavior of human subjects in an experimental setting. Several key features of the symmetric Markov perfect equilibrium (SMPE) are consistent with the data. To judge how well the SMPE fits the data, we estimate a model of Quantal Response Equilibrium (QRE) [R. McKelvey, T. Palfrey, Quantal response equilibria for normal form games, Games Econ. Behav. 10 (1995) 6-38; R. McKelvey, T. Palfrey, Quantal response equilibria for extensive form games, Exp. Econ. 1 (1998) 9-41] and find that the decision rules of the QRE model are qualitatively very similar to the empirical choice probabilities.     

Learning behavior and mixed-strategy Nash equilibria

The paper considers whether an adaptive justification, like those commonly available for non-interactive optimization models, can be found for the mixed-strategy Nash equilibrium. Although it is known that such a justification is frequently available for pure-strategy equilibria, it is shown that all members of a wide class of behaviorally plausible learning mechanisms must fail to converge in ‘almost all’ games in which the equilibrium involves mixed strategies. An exact formal analogy is developed, which allows these learning mechanisms to be viewed as discrete ta?tonnement processes in properly chosen competitive exchange economies. In the analogy, the instability derives from the independence of excess demand functions (except at the boundaries) from ‘own’ prices. This independence arises because of the linearity in probabilities of von Neumann-Morgenstern risk preferences, and therefore does not extend to pure-strategy equilibria in general. Thus, assuming that agents will play equilibrium strategies implicitly assumes more sophistication when the equilibrium involves mixed strategies than when it involves only pure strategies.     

Learning in games with unstable equilibria

We propose a new concept for the analysis of games, the TASP, which gives a precise prediction about non-equilibrium play in games whose Nash equilibria are mixed and are unstable under fictitious play-like learning. We show that, when players learn using weighted stochastic fictitious play and so place greater weight on recent experience, the time average of play often converges in these “unstable” games, even while mixed strategies and beliefs continue to cycle. This time average, the TASP, is related to the cycle identified by Shapley [L.S. Shapley, Some topics in two person games, in: M. Dresher, et al. (Eds.), Advances in Game Theory, Princeton University Press, Princeton, 1964]. The TASP can be close to or quite distinct from Nash equilibrium.     

On the endogeneity of Cournot-Nash and Stackelberg equilibria: games of accumulation

We characterize equilibria of games with two properties: (i) Agents have the opportunity to adjust their strategic variable after their initial choices and before payoffs occur; but (ii) they can only add to their initial amounts. The equilibrium set consists of just the Cournot-Nash outcome, one or both Stackelberg outcomes, or a continuum of points including the Cournot-Nash outcome and one or both Stackelberg outcomes. A simple theorem that uses agents’ standard one-period reaction functions and the one-period Cournot-Nash and Stackelberg equilibria delineates the equilibrium set. Applications include contribution, oligopoly, and rent-seeking games.     

Participation and the provision of discrete public goods: a strategic analysis

This paper considers the Nash equilibria to a game where a discrete public good is to be provided. Each individual may participate by making a fixed contribution. If a sufficient number of contributions are made, the good is provided. Otherwise, the good is not provided. One variant of the rules allows for contributions to be refunded when the good is not provided. For pure strategies, we find that the Nash equilibria with a refund are a superset of those without a refund. For both rules, the efficient number of players contributing is an equilibrium. For mixed strategies, to every equilibrium without a refund there is a corresponding equilibrium with a refund with a higher number of expected contributors. Mixed strategy equilibria ‘disappear’ as the number of players grows large. Some results reported in the experimental literature are discussed in light of these theoretical results.     

Cycling in a stochastic learning algorithm for normal form games

In this paper we study a stochastic learning model for 2×2 normal form games that are played repeatedly. The main emphasis is put on the emergence of cycles. We assume that the players have neither information about the payoff matrix of their opponent nor about their own. At every round each player can only observe his or her action and the payoff he or she receives. We prove that the learning algorithm, which is modeled by an urn scheme proposed by Arthur (1993), leads with positive probability to a cycling of strategy profiles if the game has a mixed Nash equilibrium. In case there are strict Nash equilibria, the learning process converges a.s. to the set of Nash equilibria.     

Multiplicity of Cournot Equilibria and Involuntary Unemployment

In an overlapping generations model with Cournot competition on the goods market it is shown that a continuum of stationary states and perfect foresight trajectories exists with unemployment at arbitrary low wages. Decisive for this is the influence that different forecast functions have on the objective demand curve, even though they are consistent with perfect foresight. With an example it is shown that simple adaptive and constant memory forecast rules generate such unemployment equilibria. The corresponding temporary equilibrium dynamics may display stable unemployment and unstable full employment equilibria.Journal of Economic LiteratureClassification Numbers: D43, D51, E24     

Exploitable actions of believers in the “law of small numbers” in repeated constant-sum games

In repeated fixed-pair constant-sum games with unique equilibria in mixed strategies, such as matching pennies, the subgame perfect equilibrium is repeating the stage-game mixed-strategy equilibrium action. In such games rational players avoid strategies that are exploitable, in that current actions either deviate systematically from the equilibrium action probabilities or fail to be serially independent of past actions. I revisit classic experiments and find that subjects’ actions are sometimes exploitable because they are serially dependent. Subjects have difficulty in producing serially independent actions and in recognizing serially dependent sequences due to a bias called local representativeness.     

Between-game rule learning in dissimilar symmetric normal-form games

Rule learning posits that decision makers, rather than choosing over actions, choose over behavioral rules with different levels of sophistication. Rules are reinforced over time based on their historically observed payoffs in a given game. Past works on rule learning have shown that when playing a single game over a number of rounds, players can learn to form sophisticated beliefs about others. Here we are interested in learning that occurs between games where the set of actions is not directly comparable from one game to the next. We study a sequence of ten thrice-played dissimilar games. Using experimental data, we find that our rule learning model captures the ability of players to learn to reason across games. However, this learning appears different from within-game rule learning as previously documented. The main adjustment in sophistication occurs by switching from non-belief-based strategies to belief-based strategies. The sophistication of the beliefs themselves increases only slightly over time.     

Learning to collude: An experiment in convergence and equilibrium selection in oligopoly

The paper considers a simple oligopoly model where firms know their own and the average pay-off in the industry. Firms choose decision rules for trading. The theory predicts that there are three types of Nash equilibria in this game (collusive, Cournot and Stackelberg). Our experiments test the selection process. We find that there is clear evidence of convergence to an equilibrium, and whilst both Cournot and collusive outcomes were selected, the collusive equilibrium is more common. The experimental results also give insights into the process of individual learning, confirming that subjects follow aspiration rules rather than reinforcement rules.     

Learning to Learn, Pattern Recognition, and Nash Equilibrium

The paper studies a large class of bounded-rationality, probabilistic learning models on strategic-form games. The main assumption is that players “recognize” cyclic patterns in the observed history of play. The main result is convergence with probability one to a fixed pattern of pure strategy Nash equilibria, in a large class of “simple games” in which the pure equilibria are nicely spread along the lattice of the game. We also prove that a necessary condition for convergence of behavior to a mixed strategy Nash equilibrium is that the players consider arbitrarily long histories when forming their predictions.Journal of Economic LiteratureClassification Numbers: C72, D83.     

Kantian Equilibrium

Consider a game whose strategies are "contributions". A strategy profile is a Kantian equilibrium if  no  player would like  all  players to alter their contributions by the  same multiplicative factor.  Kantian equilibria are Pareto efficient. We characterize the allocation rules on several domains of environments that can be implemented as Kantian equilibria. The concept unifies the  proportional solution  on production economies and the  linear cost-share equilibrium  on public-good economies. We study Kantian equilibrium in the prisoner's dilemma, in a voting problem, and in a political economy where redistribution is the issue. The Kantian dictum engenders considerable but not unqualified cooperation.     

The supercore for normal-form games

This paper analyzes the supercore of a system derived from a normal-form game. For the case of a finite game with pure strategies, we define a sequence of games and show that the supercore coincides with the set of Nash equilibria of the last game in that sequence. This result is illustrated with the characterization of the supercore for the n-person prisoner's dilemma. With regard to the mixed extension of a normal-form game, we show that the set of Nash equilibrium profiles coincides with the supercore for games with a finite number of Nash equilibria.     

Expectations, Drift, and Volatility in Evolutionary Games

This paper proposes an evolutionary model of learning in simple coordination games where expectations are the driving force of the process. As time proceeds, agents adjust their expectations through some (possibly different) updating rules, whose only requirement is that of consistency with long stationary evidence. Sporadically, expectations are also subject to arbitrary perturbation. The main point of the paper is that, due to the possibility of random drift on expectations, the evolutionary process will be subject to high volatility across equilibria. Specifically, every Nash equilibrium (even if risk- or payoff-dominated) will have significant positive weight in the long-run invariant distribution. Journal of Economic Literature Classification Numbers: C73. D83. D84.     

The possibility of mixed-strategy equilibria with constant-returns-to-scale technology under Bertrand competition

Abstract. We analyze the Nash equilibria of a standard Bertrand model. We show that in addition to the marginal-cost pricing equilibrium there is a possibility for mixed-strategy equilibria yielding positive profit levels. We characterize these equilibria and find that having unbounded revenues is the necessary and sufficient condition for their existence. Hence, we demonstrate that under realistic assumptions the only equilibrium is marginal-cost pricing.     

ENDOGENOUS TIMING IN QUALITY CHOICES AND PRICE COMPETITION

We modify the price‐setting version of the vertically differentiated duopoly model by Aoki (2003) by introducing an extended game in which firms noncooperatively choose the timing of moves at the quality stage. Our results show that there are multiple equilibria in pure strategies, whereby firms always select sequential play at the quality stage. We also investigate the mixed‐strategy equilibrium, revealing that the probability of generating outcomes out of equilibrium is higher than the probability of playing one Nash equilibria in pure strategies. In the alternative case with full market coverage, we show that the quality stage is solved in dominant strategies and therefore the choice of roles becomes irrelevant as the Nash and Stackelberg solutions coincide. With full market coverage and corner solution, the results show that the game has a unique subgame perfect equilibrium in pure strategies, where the high‐quality firm takes the lead in the quality stage.     

Basins of attraction and equilibrium selection under different learning rules

A deterministic learning model applied to a game with multiple equilibria produces distinct basins of attraction for those equilibria. In symmetric two-by-two games, basins of attraction are invariant to a wide range of learning rules including best response dynamics, replicator dynamics, and fictitious play. In this paper, we construct a class of three-by-three symmetric games for which the overlap in the basins of attraction under best response learning and replicator dynamics is arbitrarily small. We then derive necessary and sufficient conditions on payoffs for these two learning rules to create basins of attraction with vanishing overlap. The necessary condition requires that with probability one the initial best response is not an equilibrium to the game. The existence of parasitic or misleading actions allows subtle differences in the learning rules to accumulate.     

Simple Markovian equilibria in dynamic spatial legislative bargaining

The paper proves, by construction, the existence of Markovian equilibria in a dynamic spatial legislative bargaining model. Players bargain over policies in an infinite horizon. In each period, a sequential protocol of proposal-making and voting, with random proposer recognitions and a simple majority, produces a policy that becomes the next period's status-quo; the status-quo is endogenous. The construction relies on simple strategies determined by strategic bliss points computed by the algorithm we provide. A strategic bliss point, the dynamic utility ideal, is a moderate policy relative to a bliss point, the static utility ideal. Moderation is strategic and germane to the dynamic environment; players moderate in order to constrain the future proposals of opponents. Moderation is a strategic substitute; when a player's opponents do moderate, she does not, and when they do not moderate, she does. We provide conditions under which the simple strategies induced by the strategic bliss points computed by the algorithm deliver a Stationary Markov Perfect equilibrium, and we prove its existence in generic games with impatient players and in symmetric games. Because the algorithm constructs all equilibria in simple strategies, we provide their general characterization, and we show their generic uniqueness.     

Structural holes in social networks: A remark

In a recent article, [S. Goyal, F. Vega-Redondo, Structural holes in social networks, J. Econ. Theory 137 (1) (2007) 460-492] the authors (GVR) showed the importance of stars and cycles in a given network formation game. Implicitly, in their article, a network is called an equilibrium if it is generated by an equilibrium strategy. We extend the results of GVR to the case of a stronger requirement: namely, that a network can be called an equilibrium only if all the strategies generating it are equilibria. We also show, in a dynamic framework, that both definitions differ in crucial ways.