Stochastic imitation in finite games

In this paper we model an evolutionary process with perpetual random shocks, where individuals sample population-specific strategy-payoff pairs and imitate the most successful behavior. For finite n-player games we prove that in the limit, as the perturbations tend to zero, only strategy-tuples in minimal sets closed under single better replies will be played with positive probability. If the strategy-tuples in one such minimal set have strictly higher payoffs than all outside strategy-tuples, then the strategy-tuples in this set will be played with probability one in the limit, provided the minimal set is a product set and the sample is sufficiently large.     

Uniform selection in global games

This paper brings together results which are required in order to extend the global games approach to settings where the game structure is endogenous. More precisely, it shows that the selection argument of Carlsson and van Damme [Global games and equilibrium selection, Econometrica 61(5) (1993) 989-1018] holds uniformly over appropriately controlled families of games. Those results also give proper justification for the inversion of limits which is often implicit in applied work taking comparative statics on the selected risk-dominant equilibrium.     

Coordination and delay in global games

What is the effect of offering agents an option to delay their choices in a global coordination game? We address this question by considering a canonical binary action global game, and allowing players to delay their irreversible decisions. Those that delay have access to accurate private information at the second stage, but receive lower payoffs. We show that, as noise vanishes, as long as the benefit to taking the risky action early is greater than the benefit of taking the risky action late, the introduction of the option to delay reduces the incidence of coordination failure in equilibrium relative to the standard case where all agents must choose their actions at the same time. We outline the welfare implications of this finding, and probe the robustness of our results from a variety of angles.     

Noise-independent selection in multidimensional global games

This paper examines many-player many-action global games with multidimensional state parameters. It establishes that the notion of noise-independent selection introduced by Frankel, Morris and Pauzner [D. Frankel, S. Morris, A. Pauzner, Equilibrium selection in global games with strategic complementarities, J. Econ. Theory 108 (2003) 1–44] for one-dimensional global games is robust when the setting is extended to the one proposed by Carlsson and Van Damme [H. Carlsson, E. Van Damme, Global games and Equilibrium selection, Econometrica 61 (1993) 989–1018]. More precisely, our main result states that if an action profile of some complete information game is noise-independently selected in one-dimensional global games, then it is also noise-independently selected in all multidimensional global games.     

Tractable dynamic global games and applications

We present a family of tractable dynamic global games and its applications. Agents privately learn about a fixed fundamental, and repeatedly adjust their investments while facing frictions. The game exhibits many externalities: payoffs may depend on the volume of investment, on its volatility, and on its concentration. The solution is driven by an invariance result: aggregate investment is (in a pivotal contingency) invariant to a large family of frictions. We use the invariance result to examine how frictions, including those similar to the Tobin tax, affect equilibrium. We identify conditions under which frictions discourage harmful behavior without compromising investment volume.     

Stochastic better-reply dynamics in finite games

In this paper, we analyze a model where individuals from finite populations are repeatedly drawn to play a finite game and in every period choose a weakly better reply to a sample distribution from a finite history of past play. For all finite games and sufficiently incomplete information, we prove convergence to minimal sets closed under better replies. This result complements previous findings in a deterministic continuous-time framework and implies convergence to strict Nash equilibria in many well-known classes of games.     

Equilibrium selection in global games with strategic complementarities

We study games with strategic complementarities, arbitrary numbers of players and actions, and slightly noisy payoff signals. We prove limit uniqueness: as the signal noise vanishes, the game has a unique strategy profile that survives iterative dominance. This generalizes a result of Carlsson and van Damme (Econometrica 61 (1993) 989-1018) for two-player, two-action games. The surviving profile, however, may depend on fine details of the structure of the noise. We provide sufficient conditions on payoffs for there to be noise-independent selection.     

The envelope theorem for locally differentiable Nash equilibria of finite horizon differential games

Envelope theorems are established for a ubiquitous class of finite horizon differential games. The theorems cover open-loop and feedback information patterns in which the corresponding Nash equilibria are locally differentiable with respect to the parameters of the game. Their relationship with extant envelope results is discussed and an application of them to a generalized capital accumulation game is provided. An important implication of the theorems is that, in general, the archetypal economic interpretation of the costate vector, namely, as the shadow value of the state vector along the Nash equilibrium, is valid for feedback Nash equilibria, but not for open-loop Nash equilibria.     

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.     

Strategic market games with a finite horizon and incomplete markets

Summary. We study a strategic market game associated to an intertemporal economy with a finite horizon and incomplete markets. We demonstrate that generically, for any finite number of players, every sequentially strictly individually rational and default-free stream of allocations can be approximated by a full subgame-perfect equilibrium. As a consequence, imperfect competition may Pareto-dominate perfect competition when markets are incomplete. Moreover - and this contrasts with the main message conveyed by the market games literature - there exists a large open set of initial endowments for which full subgame-perfect equilibria do not converge to -efficient allocations when the number of players tends to infinity. Finally, strategic speculative bubbles may survive at full subgame-perfect equilibria.Received: 24 January 2002, Revised: 21 February 2003, JEL Classification Numbers: C72, D43, D52. Correspondence to: Gaël GiraudWe thank Tim Van Zandt for his comments.     

Coordination and learning in dynamic global games: experimental evidence

Coordination problems are ubiquitous in social and economic life. Political mass demonstrations, the decision whether to join a speculative currency attack, investment in a risky venture, and capital flight from a particular country are all characterized by coordination problems. Furthermore, all these events have a dynamic nature which has been largely omitted from previous experimental studies. Here I use a two-stage variant of a dynamic global game to study experimentally how the arrival of information in a dynamic setting affects the relative aggressiveness of speculators. In the first stage, subjects exhibit excess aggressiveness, which appears to be driven by beliefs about others’ actions rather than an intrinsic taste for attacking. However, following a failed first-stage attack, subjects learn to be less aggressive in the second stage. On the other hand, the arrival of new, more precise information after a failed attack leads to an increase in subjects’ aggressiveness. Beliefs, again, play a crucial role in explaining how the arrival of information affects attacking behavior.     

Existence of Nash equilibria in finite extensive form games with imperfect recall: A counterexample

This paper provides an example showing that for finite extensive form games without perfect recall existence of Nash equilibria in behaviour strategies is not guaranteed in general.     

Markets for contracts: experiments exploring the compatibility of games and markets for games

Summmary. The research explores the relationship between games and the economic environment in which the games might be embedded. The focus is on a market institution in which agents buy and sell rights to participate in a follow-on stage of strategic interaction. The central question posed concerns how two different types of processes, the game and the market, interact. The market converges to a competitive equilibrium that is consistent with the Nash equilibrium that obtains in the game, and the convergence of the market to a competitive equilibrium lags the convergence of behaviors in the game to a Nash equilibrium.     

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.     

Utility functions for simple games

This note characterizes the Shapley-Shubik index and the Banzhaf index on the class of simple games as utility functions which reflect different postures toward risk.     

A cooperative study of one-commodity market games

A competitive model is attached to a particular market where several agents trade a same commodity. We focus on the stability of the price systems and define a solution concept, akin to the core, proving an existence result. The author wishes to thank the Editor and an anonymous referee for useful comments and remarks.     

Global Newton Method for stochastic games

The Global Newton Method for games in normal form and in extensive form is shown to have a natural extension to computing Markov-perfect equilibria of stochastic games.