Professional advice

This paper studies strategic communication by an expert who is concerned about appearing to be well informed. The expert is assumed to observe a private signal with a simple and particularly tractable (multiplicative linear) structure. The quality of the expert's information is evaluated on the basis of the advice given and the realized state of the world. In equilibrium of this reputational cheap-talk game, no more than two messages are effectively reported. The model is extended to consider sequential communication by experts with conditionally independent signals. In the long run, learning is incomplete and herd behavior arises.     

Contagion and efficiency

We consider a population of agents, either finite or countably infinite, located on an arbitrary network. Agents interact directly only with their immediate neighbors, but are able to observe the behavior of (some) other agents beyond their interaction neighborhood, and learn from that behavior by imitating successful actions. If interactions are not “too global” but information is fluid enough, we show that the efficient action is the only one which can spread contagiously to the whole population from an initially small, finite subgroup. This result holds even in the presence of an alternative, -dominant action.     

Knightian games and robustness to ambiguity

This paper introduces a notion of robustness to ambiguous beliefs for Bayesian Nash equilibria. An equilibrium is robust if the corresponding strategies remain approximately optimal for a class of games with ambiguous beliefs that results from an appropriately defined perturbation of the belief structure of the original non-ambiguous belief game. The robustness definition is based on a novel definition of equilibrium for games with ambiguous beliefs that requires equilibrium strategies to be approximate best responses for all measures that define a player's belief. Conditions are derived under which robustness is characterized by a newly defined strategic continuity property, which can be verified without reference to perturbations and corresponding ambiguous belief games.     

Learning in games with strategic complementarities revisited

Fictitious play is a classical learning process for games, and games with strategic complementarities are an important class including many economic applications. Knowledge about convergence properties of fictitious play in this class of games is scarce, however. Beyond games with a unique equilibrium, global convergence has only been claimed for games with diminishing returns [V. Krishna, Learning in games with strategic complementarities, HBS Working Paper 92-073, Harvard University, 1992]. This result remained unpublished, and it relies on a specific tie-breaking rule. Here we prove an extension of it by showing that the ordinal version of strategic complementarities suffices. The proof does not rely on tie-breaking rules and provides some intuition for the result.     

Time-consistent policies

In many cases the optimal open-loop policy to influence agents who solve dynamic problems is time inconsistent. We show how to construct a time-consistent open-loop policy rule. We also consider an additional restriction under which the time-consistent open-loop policy is stationary. We use examples to illustrate the properties of these tax rules.     

On the convergence of reinforcement learning

This paper examines the convergence of payoffs and strategies in Erev and Roth's model of reinforcement learning. When all players use this rule it eliminates iteratively dominated strategies and in two-person constant-sum games average payoffs converge to the value of the game. Strategies converge in constant-sum games with unique equilibria if they are pure or if they are mixed and the game is 2×2. The long-run behaviour of the learning rule is governed by equations related to Maynard Smith's version of the replicator dynamic. Properties of the learning rule against general opponents are also studied.     

Fictitious play in 2×n games

It is known that every discrete-time fictitious play process approaches equilibrium in nondegenerate 2×2 games, and that every continuous-time fictitious play process approaches equilibrium in nondegenerate 2×2 and 2×3 games. It has also been conjectured that convergence to the set of equilibria holds generally for nondegenerate 2×n games. We give a simple geometric proof of this for the continuous-time process, and also extend the result to discrete-time fictitious play.     

Incentive effects: The case of belief elicitation from individuals in groups

Non-incentivized belief elicitation has a negative effect on the belief accuracy of experienced observers predicting choices in 2 × 2 matrix games. This negative impact extends to the accuracy of group beliefs and revised beliefs after forecasters know each other's initial beliefs.     

Credulity, lies, and costly talk

This paper studies a model of strategic communication by an informed and upwardly biased sender to one or more receivers. Applications include situations in which (i) it is costly for the sender to misrepresent information, due to legal, technological, or moral constraints, or (ii) receivers may be credulous and blindly believe the sender's recommendation. In contrast to the predictions obtained in the benchmark cheap talk model, our model admits a fully separating equilibrium, provided that the state space is unbounded above. The language used in equilibrium is inflated and naive receivers are deceived.     

Perturbed communication games with honest senders and naive receivers

This paper studies communication games in which the sender is possibly honest (tells the truth) and the receiver is possibly naive (follows messages as if truthful). The characterization of message-monotone equilibria in the perturbed games explain several important aspects of strategic communication including sender exaggeration, receiver skepticism and message clustering. Surprisingly, the strategic receiver may respond to more aggressive claims with more moderate actions. In the limit as the probabilities of the non-strategic players approach zero, (i) the limit equilibrium corresponds to a most-informative equilibrium of the limit (Crawford-Sobel) game; (ii) only the top messages are sent.     

Coordination of mobile labor

We study coordination failures in many simultaneously occurring coordination problems. Players encounter one of the problems but have the outside option of migrating to one of the remaining ones. Drawing on the global games approach, we show that such a mobile game has a unique equilibrium that allows us to examine comparative statics. The endogeneity of the outside option value and of the migration activity leads to non-monotonicity of welfare with respect to mobility friction; high mobility may hurt players. We apply these “general equilibrium’’ findings to the problem of the labor market during industrialization as described by Matsuyama [Increasing returns, industrialization and indeterminacy of equilibrium, Quart. J. Econ. 106 (1991) 617-650].     

Fictitious play property of the Nash demand game

We show that the Nash demand game has the fictitious play property. We also show that almost every fictitious play process and its associated belief path converge to a pure-strategy Nash equilibrium in the Nash demand game.     

Communication via a strategic mediator

This paper investigates communication between an informed expert and an uninformed principal via a strategic mediator. We demonstrate that, for any bias in the parties' preferences, there exists a strategic mediator that provides the highest expected payoff to the principal, as if the players had communicated through an optimal non-strategic mediator.     

Dynamic coordination with individual learning

We study coordination in dynamic global games with private learning. Players choose whether and when to invest irreversibly in a project whose success depends on its quality and the timing of investment. Players gradually learn about project quality. We identify conditions on temporal incentives under which, in sufficiently long games, players coordinate on investing whenever doing so is not dominated. Roughly speaking, this outcome occurs whenever players? payoffs are sufficiently tolerant of non-simultaneous coordination. We also identify conditions under which players coordinate on the risk-dominant action. We provide foundations for these results in terms of higher order beliefs.     

Endogenous private information structures

We formally incorporate the option to gather information into a game and thus endogenize the information structure. We ask whether models with exogenous information structures are robust with respect to this endogenization. Any Nash equilibrium of the game with information acquisition induces a Nash equilibrium in the corresponding game with an exogenous structure. We provide sufficient conditions on the structure of the game for which this remains true when ‘Nash’ is replaced by ‘sequential’. We characterize the (sequential) Nash equilibria of games with exogenous information structures that can arise as a (sequential) Nash equilibrium of games with endogenous information acquisition.     

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.     

Testing the TASP: An experimental investigation of learning in games with unstable equilibria

We report experiments studying mixed strategy Nash equilibria that are theoretically stable or unstable under learning. The Time Average Shapley Polygon (TASP) predicts behavior in the unstable case. We study two versions of Rock-Paper-Scissors that include a fourth strategy, Dumb. The unique Nash equilibrium is identical in the two games, but the predicted frequency of Dumb is much higher in the game where the NE is stable. Consistent with TASP, the observed frequency of Dumb is lower and play is further from Nash in the high payoff unstable treatment. However, Dumb is played too frequently in all treatments.