Large deviations and multinomial probit choice

We consider a discrete choice model in which the payoffs to each of an agent?s n actions are subjected to the average of m i.i.d. shocks, and use tools from large deviations theory to characterize the rate of decay of the probability of choosing a given suboptimal action as m approaches infinity. Our model includes the multinomial probit model of Myatt and Wallace (2003) [5] as a special case. We show that their formula describing the rates of decay of choice probabilities is incorrect, provide the correct formula, and use our large deviations analysis to provide intuition for the difference between the two.     

The folk theorem for irreducible stochastic games with imperfect public monitoring

This paper introduces stochastic games with imperfect public signals. It provides a sufficient condition for the folk theorem when the game is irreducible, thus generalizing the results of Dutta (1995) [5] and Fudenberg, Levine, and Maskin (1994) [9]. To do this, the paper extends the concept of self-generation (Abreu, Pearce, and Stacchetti, 1990 [1]) to “return generation,” which explicitly tracks actions and incentives until the next time the state returns to its current value, and asks that players not wish to deviate given the way their continuation payoffs from the time of this return depend on the public signals that have been observed.     

Stationary equilibria in stochastic games: structure, selection, and computation

This paper introduces an algorithm to compute stationary equilibria in stochastic games that is guaranteed to converge for almost all such games. Since in general the number of stationary equilibria is overwhelming, we pay attention to the issue of equilibrium selection. We do this by extending the linear tracing procedure to the class of stochastic games, called the stochastic tracing procedure. As a by-product of our results, we extend a recent result on the generic finiteness of stationary equilibria in stochastic games to oddness of equilibria.     

Pigouvian pricing and stochastic evolutionary implementation

We study the implementation of efficient behavior in settings with externalities. A planner would like to ensure that a group of agents make socially optimal choices, but he only has limited information about the agents’ preferences, and can only distinguish individual agents through the actions they choose. We describe the agents’ behavior using a stochastic evolutionary model, assuming that their choice probabilities are given by the logit choice rule. We prove that there is a simple price scheme with the following property: regardless of the realization of preferences, a group of agents subjected to the price scheme will spend the vast majority of time in the long run behaving efficiently. The price scheme defines a game that may possess multiple equilibria, but we are able to obtain a unique and efficient selection from this set because of the stochastic nature of the agents’ choice rule. We conclude by comparing the performance of our price scheme with that of VCG mechanisms.     

A comment on “Egalitarianism and efficiency in repeated symmetric games” by V. Bhaskar [Games Econ. Behav. 32 (2000) 247-262]

We identify an error in Bhaskar?s (2000) Proposition 4. We provide counterexamples to this result and demonstrate that it is not correctable.     

The strategic value of recall

This work studies the value of two-person zero-sum repeated games in which at least one of the players is restricted to (mixtures of) bounded recall strategies. A (pure) k-recall strategy is a strategy that relies only on the last k periods of history. This work improves previous results ( [Lehrer, 1988] and [Neyman and Okada, 2009]) on repeated games with bounded recall. We provide an explicit formula for the asymptotic value of the repeated game as a function of the one-stage game, the duration of the repeated game, and the recall of the agents.     

Mixed equilibria are unstable in games of strategic complements

In games with strict strategic complementarities, properly mixed Nash equilibria—equilibria that are not in pure strategies—are unstable for a broad class of learning dynamics.     

Risk-dominance and perfect foresight dynamics in N-player games

In perfect foresight dynamics, an action is linearly stable if expectation that people will always choose the action is self-fulfilling. A symmetric game is a PIM game if an opponent's particular action maximizes the incentive of an action, independently of the rest of the players. This class includes supermodular games, games with linear incentives and so forth. We show that, in PIM games, linear stability is equivalent to u-dominance, a generalization of risk-dominance, and that there is no path escaping a u-dominant equilibrium. Existing results on N-player coordination games, games with linear incentives and two-player games are obtained as corollaries.     

EVOLUTIONARY DRIFT IN PREFERENCE AND EQUILIBRIUM SELECTION*

This paper studies the situation where myopic players repeatedly face a society with two actions where their common fitness exhibits economies of scale. Both states in which all players choose the same actions are equilibria. In each period, players adjust their actions based on their preferences, which are in turn shaped by natural selection. The preferences of the players need not match the underlying fitness. When rare mutations are introduced into the evolutionary process, their preferences may drift without affecting equilibrium behaviour. This paper shows that these drifts influence the results of equilibrium selection.     

Evolution in games with randomly disturbed payoffs

We consider a simple model of stochastic evolution in population games. In our model, each agent occasionally receives opportunities to update his choice of strategy. When such an opportunity arises, the agent selects a strategy that is currently optimal, but only after his payoffs have been randomly perturbed. We prove that the resulting evolutionary process converges to approximate Nash equilibrium in both the medium run and the long run in three general classes of population games: stable games, potential games, and supermodular games. We conclude by contrasting the evolutionary process studied here with stochastic fictitious play.     

Stable games and their dynamics

We study a class of population games called stable games. These games are characterized by self-defeating externalities: when agents revise their strategies, the improvements in the payoffs of strategies to which revising agents are switching are always exceeded by the improvements in the payoffs of strategies which revising agents are abandoning. We prove that the set of Nash equilibria of a stable game is globally asymptotically stable under a wide range of evolutionary dynamics. Convergence results for stable games are not as general as those for potential games: in addition to monotonicity of the dynamics, integrability of the agents' revision protocols plays a key role.     

A limit characterization of belief-free equilibrium payoffs in repeated games

The present paper studies repeated games with private monitoring, and characterizes the set of belief-free equilibrium payoffs in the limit as the discount factor approaches one and the noise on private information vanishes. Contrary to the conjecture by Ely et al. [J.C. Ely, J. Hörner, W. Olszewski, Belief-free equilibria in repeated games, Econometrica 73 (2005) 377-415], the equilibrium payoff set is computed by the same formula, no matter how many players there are. As an application of this result, a version of the folk theorem is established for N-player prisoner's dilemma games.     

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.     

Public randomization in the repeated prisoner’s dilemma game with local interaction

We consider a situation in which each agent observes only their neighbor’s actions and locally interacts with them by playing prisoner’s dilemma games. Introducing a public randomization, we construct an equilibrium which sustains cooperation and in which cooperation eventually resumes after any history.     

Dynamic psychological games

The motivation of decision makers who care for various emotions, intentions-based reciprocity, or the opinions of others may depend directly on beliefs (about choices, beliefs, or information). Geanakoplos, Pearce and Stacchetti [J. Geanakoplos, D. Pearce, E. Stacchetti, Psychological games and sequential rationality, Games Econ. Behav. 1 (1989) 60-79] point out that traditional game theory is ill-equipped to address such matters, and they pioneer a new framework which does. However, their toolbox - psychological game theory - incorporates several restrictions that rule out plausible forms of belief-dependent motivation. Building on recent work on dynamic interactive epistemology, we propose a more general framework. Updated higher-order beliefs, beliefs of others, and plans of action may influence motivation, and we can capture dynamic psychological effects (such as sequential reciprocity, psychological forward induction, and regret) that were previously ruled out. We develop solution concepts, provide examples, explore properties, and suggest avenues for future research.     

Large deviations and equilibrium selection in large populations

This paper uses the theory of large deviations to analyse equilibrium selection in one-dimensional games with large populations where the system evolves according to a jump Markov process. The equilibria selected maximise a quasi-potential function which can be determined by solving a polynomial equation. Estimates of waiting times are also given. It shows that the equilibria about which there is more noise are less likely to be selected and clarifies the role of the limiting deterministic dynamic in selection.