The Envelope Theorem and Comparative Statics of Nash Equilibria

The Envelope Theorem for Nash equilibria shows that the strategic reaction of the other players in the game is important for determining how parameter perturbations affect a given player's indirect objective function. The fundamental comparative statics matrix of Nash equilibria for theithplayer in anN-player static game includes the equilibrium response of the otherN−1players in the game to the parameter perturbation and is symmetric positive semidefinite subject to constraint. This result is fundamental in that it holds for all sufficiently smooth Nash equilibria and is independent of any curvature or stability assumptions imposed on the game.Journal of Economic LiteratureClassification Numbers: C72, C61.     

Nash Equilibrium and Welfare Optimality

If A is a set of social alternatives, a social choice rule (SCR) assigns a subset of A to each potential profile of individuals' preferences over A , where the subset is interpreted as the set of "welfare optima". A game form (or "mechanism") implements the social choice rule if, for any potential profile of preferences, (i) any welfare optimum can arise as a Nash equilibrium of the game form (implying, in particular, that a Nash equilibrium exists) and, (ii) all Nash equilibria are welfare optimal. The main result of this paper establishes that any SCR that satisfies two properties—monotonicity and no veto power—can be implemented by a game form if there are three or more individuals. The proof is constructive.     

Laboratory Federalism: The Open Method of Coordination (OMC) as an Evolutionary Learning Process

In view of the concept of laboratory federalism, the Open Method of Coordination (OMC), adopted by the EU as a mode of governance, can be interpreted as an imitative learning dynamics of the type considered in evolutionary game theory. Its iterative design and focus on good practice are captured by the behavioral rule “imitate the best.” In a redistribution game with utilitarian governments and mobile welfare recipients, we compare the outcomes of imitative behavior (long‐run evolutionary equilibria) and decentralized best‐response behavior (Nash equilibria). The learning dynamics leads to coordination on a strict subset of Nash equilibria, favoring policy choices that can be sustained by a simple majority of Member States.     

Robust equilibria under non-common priors

This paper considers the robustness of equilibria to a small amount of incomplete information, where players are allowed to have heterogeneous priors. An equilibrium of a complete information game is robust to incomplete information under non-common priors if for every incomplete information game where each player's prior assigns high probability on the event that the players know at arbitrarily high order that the payoffs are given by the complete information game, there exists a Bayesian Nash equilibrium that generates behavior close to the equilibrium in consideration. It is shown that for generic games, an equilibrium is robust under non-common priors if and only if it is the unique rationalizable action profile. Set-valued concepts are also introduced, and for generic games, a smallest robust set is shown to exist and coincide with the set of a posteriori equilibria.     

Separating the Hawks from the Doves: Evidence from continuous time laboratory games

Human players in our laboratory experiment received flow payoffs over 120 seconds each period from a standard Hawk–Dove bimatrix game played in continuous time. Play converged closely to the symmetric mixed Nash equilibrium under a one-population matching protocol. When the same players were matched in a two-population protocol with the same bimatrix, they showed clear movement towards an asymmetric (and very inequitable) pure Nash equilibrium of the game. These findings support distinctive predictions of evolutionary game theory.     

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.     

On Nash implementation of Walrasian equilibria in a market for pure indivisibles without money

This paper deals with the Walrasian property of Nash and strong equilibria of a specific strategic market game which refers to a pure exchange economy involving purely indivisible commodities and no money. The game is of sealed-bid auction type and it is shown that any Nash equilibrium at which no agent is in status quo is a strong equilibrium and implements a Walrasian equilibrium. Moreover, it appears that two modifications of the game's rules ensure that any strong equilibrium outcome is Walrasian. These results are identical to those obtained by Svensson for markets involving purely indivisible goods and money.     

Thematic Clubs and the Supremacy of Network Externalities

We explore the issue of minorities' survival in the presence of positive network externalities. We rely on a simple example of thematic clubs to illustrate why and how such survival problems might appear, first considering the case of simple‐network effects (fully anonymous externalities) and then the case of cross‐network effects (type‐dependent externalities). In both cases, the analysis is framed as a simple noncooperative game with a continuum of players and binary action sets. There is a unique and interior Nash equilibrium under mild network effects and two corner equilibria under strong network effects, with one club driven out. A utilitarian planner would accentuate the clustering effects of network externalities, and call for the disappearance of the minority club more often than the noncooperative solution. A simple myopic learning algorithm capturing the progression of network lock‐in effects is studied.     

Two equivalence results for two-person strict games

A game is strict if for both players, different profiles have different payoffs. Two games are best response equivalent if their best response functions are the same. We prove that a two-person strict game has at most one pure Nash equilibrium if and only if it is best response equivalent to a strictly competitive game, and that it is best response equivalent to an ordinal potential game if and only if it is best response equivalent to a quasi-supermodular game.     

Cooperative R&D and Strategic Trade Policy with Bertrand Competition

This paper uses a strategic trade policy model to analyze the welfare effects from allowing cooperation in R&D when firms compete in a price‐setting game in the product market. A policy game between two governments is analyzed, where each government chooses a particular cooperative R&D policy in order to maximize national welfare. At the Nash equilibrium to this game only one government allows cooperation in R&D. This equilibrium is both individually and jointly optimal. International cooperation in R&D is superior to no cooperation in R&D but is inferior to the Nash equilibrium of the government policy game.     

Maskin's Theorem with limited veto power

We weaken the no-veto power condition of Maskin [Maskin, E.,1999. Nash equilibrium and welfare optimality. Rev. Econ. Stud. 66, 23–38] to limited veto power, and prove that any monotonic social choice rule is Nash implementable if it satisfies this weaker condition. The result is obtained by using the canonical Maskin mechanism without modification. An immediate corollary is that the weak core is Nash implementable in any coalitional game environment. An example is given to show that the strong core need not be implementable, even when it is monotonic.     

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.     

p-Dominance and Equilibrium Selection under Perfect Foresight Dynamics

This paper studies equilibrium selection based on a class of perfect foresight dynamics and relates it to the notion of p-dominance. A continuum of rational players is repeatedly and randomly matched to play a symmetric n×n game. There are frictions: opportunities to revise actions follow independent Poisson processes. The dynamics has stationary states, each of which corresponds to a Nash equilibrium of the static game. A strict Nash equilibrium is linearly stable under the perfect foresight dynamics if, independent of the current action distribution, there exists a consistent belief that any player necessarily plays the Nash equilibrium action at every revision opportunity. It is shown that a strict Nash equilibrium is linearly stable under the perfect foresight dynamics with a small degree of friction if and only if it is the p-dominant equilibrium with p<1/2. It is also shown that if a strict Nash equilibrium is the p-dominant equilibrium with p<1/2, then it is uniquely absorbing (and globally accessible) for a small friction (but not vice versa). Set-valued stability concepts are introduced and their existence is shown. Journal of Economic Literature Classification Numbers: C72, C73.     

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.     

Coordination need not be a problem

In a game of common interest there is one action vector that all players prefer to every other. Yet there may be multiple Pareto-ranked Nash equilibria in the game and the “coordination problem” refers to the fact that rational equilibrium play cannot rule out Pareto-dominated equilibria. In this paper, I prove that two elements — asynchronicity and a finite horizon — are sufficient to uniquely select the Pareto-dominant action vector (in subgame perfect equilibrium play). Asynchronicity may be exogenously specified by the rules of the game. Alternatively, in a game where players choose when to move, asynchronicity may emerge as an equilibrium move outcome.     

Nash consistent representation of effectivity functions through lottery models

Effectivity functions for finitely many players and alternatives are considered. It is shown that every monotonic and superadditive effectivity function can be augmented with equal chance lotteries to a finite lottery model—i.e., an effectivity function that preserves the original effectivity in terms of supports of lotteries—which has a Nash consistent representation. The latter means that there exists a finite game form which represents the lottery model and which has a Nash equilibrium for any profile of utility functions satisfying the minimal requirement of respecting first order stochastic dominance among lotteries. No additional condition on the original effectivity function is needed.     

Pareto optimality of non-cooperative equilibrium in a time-dependent multi-period game

This paper deals with the conditions under which cooperation could be advantageous to the various players in a linear-quadratic dynamic game. The conclusions, which are arrived at by comparing the non-cooperative Nash equilibrium with the set of Pareto optimal strategies, point to the presence of strong incentives for cooperation. The analysis is applicable to problems of interdependent decision-making in international or interregional economics, thereby stressing the importance of suitable coordination schemes.     

Generalised weakened fictitious play

A general class of adaptive processes in games is developed, which significantly generalises weakened fictitious play [Van der Genugten, B., 2000. A weakened form of fictitious play in two-person zero-sum games. Int. Game Theory Rev. 2, 307–328] and includes several interesting fictitious-play-like processes as special cases. The general model is rigorously analysed using the best response differential inclusion, and shown to converge in games with the fictitious play property. Furthermore, a new actor–critic process is introduced, in which the only information given to a player is the reward received as a result of selecting an action—a player need not even know they are playing a game. It is shown that this results in a generalised weakened fictitious play process, and can therefore be considered as a first step towards explaining how players might learn to play Nash equilibrium strategies without having any knowledge of the game, or even that they are playing a game.     

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.     

Maximum‐revenue versus Optimum‐welfare Export Taxes: a Delegation Game*

In the Eaton and Grossman (1986 ) Bertrand duopoly model of strategic export taxes, both countries may be better off if they both delegate to policymakers who maximize tax revenue rather than welfare. However, both countries delegating to policymakers who maximize tax revenue is not a Nash equilibrium unless the degree of product substitutability is sufficiently high. For a wide range of values for the degree of product substitutability, the game is a prisoner's dilemma where both countries are better off delegating to policymakers who maximize tax revenue but both will delegate to policymakers who maximize welfare in the Nash equilibrium.