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.     

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.     

Coordination failure in repeated games with private monitoring

Players coordinate continuation play in repeated games with public monitoring. We investigate the robustness of such equilibrium behavior with respect to ex-ante small private-monitoring perturbations. We show that with full support of public signals, no perfect public equilibrium is robust if it induces a “regular” 2×2$2\times 2$ coordination game in the continuation play. This regularity condition is violated in all belief-free equilibria. Indeed, with an individual full rank condition, every interior belief-free equilibrium is robust. We also analyze block belief-free equilibria and point out that the notion of robustness is sensitive to whether we allow for uninterpretable signals.     

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.     

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.     

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].     

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.     

Information structures with unawareness

I construct a state space model with unawareness following [R.J. Aumann, Agreeing to disagree, Ann. Stat. 76 (1976) 1236-1239]. Dekel et al. [E. Dekel, B.L. Lipman, A. Rustichini, Standard state-space models preclude unawareness, Econometrica 66 (1998) 159-173] show that standard state space models are incapable of representing unawareness. The model circumvents the impossibility result by endowing the agent with a subjective state space that differs from the full state space when he has the unawareness problem. Information is modeled as a pair, consisting of both factual information and awareness information. The model preserves the central properties of the standard information partition model.     

Reputation and exogenous private learning

Short-run competitors in the chain store game receive noisy signals of the long-run incumbent firm's type. The history of signals, which in the limit is fully revealing, is observable to the competitors but possibly not to the incumbent. As long as there is sufficient noise in the signals, then in any equilibrium a patient weak incumbent obtains a payoff strictly higher than her minmax payoff.     

Decentralized learning from failure

We study decentralized learning in organizations. Decentralization is captured through Crawford and Haller's [Learning how to cooperate: optimal play in repeated coordination games, Econometrica 58 (1990) 571-595] attainability constraints on strategies. We analyze a repeated game with imperfectly observable actions. A fixed subset of action profiles are successes and all others are failures. The location of successes is unknown. The game is played until either there is a success or the time horizon is reached. We partially characterize optimal attainable strategies in the infinite horizon game by showing that after any fixed time, agents will occasionally randomize while at the same time mixing probabilities cannot be uniformly bounded away from zero.     

Informational control and organizational design

This paper focuses on issues of allocating authority between an uninformed principal and an informed expert. We analyze the benefits of informational control—restricting the precision of the expert's information (without learning its content). In this case, the result of Dessein (2002) [8] that delegating decisions to a perfectly informed expert is better than communication when preferences between the expert and the principal are not too far apart is reversed. We demonstrate that these organizational forms—informational control and delegation—can be either complements or substitutes, depending on the principal's ability to affect the expert's discretion about the set of allowed policies.     

The strategy of manipulating joint decision-making

We study a model of strategic persuasion based on the theory of cheap talk, in which a better-informed agent manipulates two decision-makers’ joint decision on alternative proposals. With the heterogeneity of two decision-makers’ value of the outside option, only the decision-maker with the better outside option is critical in determining whether communication is truthful, overselling, or ineffective.     

Optimal mechanism design with resale via bargaining

In this paper, we examine the optimal mechanism design of selling an indivisible object to one regular buyer and one publicly known buyer, where inter-buyer resale cannot be prohibited. The resale market is modeled as a stochastic ultimatum bargaining game between the two buyers. We fully characterize an optimal mechanism under general conditions. Surprisingly, in this optimal mechanism, the seller never allocates the object to the regular buyer regardless of his bargaining power in the resale market. The seller sells only to the publicly known buyer, and reveals no additional information to the resale market. The possibility of resale causes the seller to sometimes hold back the object, which under our setup is never optimal if resale is prohibited. We find that the seller?s revenue is increasing in the publicly known buyer?s bargaining power in the resale market. When the publicly known buyer has full bargaining power, Myerson?s optimal revenue is achieved; when the publicly known buyer has no bargaining power, a conditionally efficient mechanism prevails.     

Endogenous Alleviation of Overreaction Problem by Aggregate Information Announcement

It is well‐known that agents overreact to public information in markets characterized by strategic complementarities. We propose a simple and implementable method of alleviating the overreaction problem. Extending the beauty‐contest game of Morris and Shin to a multi‐region economy, we show that, under an aggregate information announcement, each agent converts purely public information into imperfect public information endogenously. This makes the agents’ beliefs dispersed and alleviates the overreaction problem. Moreover, we compare the welfare effect of the aggregate information announcement with that of a separate announcement. We find that there exist plausible situations where the aggregate information announcement is better than the separate information announcement despite reduced quality.     

Optimal limited authority for principal

This article studies a principal-agent problem where the only commitment for the uninformed principal is to restrict the set of decisions she makes following a report by the informed agent. We show that an ex ante optimal equilibrium for the principal corresponds to a finite partition of the state space, and each retained decision is ex post suboptimal for the principal, biased toward the agent?s preference. Generally an optimal equilibrium does not maximize the number of decisions the principal can credibly retain. Compared to no commitment, limited authority improves the quality of communication from the agent. As a result, it can give the principal a higher expected payoff than delegating the decision to the agent.     

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.     

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.