The Theory of Global Games on Test: Experimental Analysis of Coordination Games with Public and Private Information

The theory of global games has shown that coordination games with multiple equilibria may have a unique equilibrium if certain parameters of the payoff function are private information instead of common knowledge. We report the results of an experiment designed to test the predictions of this theory. Comparing sessions with common and private information, we observe only small differences in behavior. For common information, subjects coordinate on threshold strategies that deviate from the global game solution towards the payoff‐dominant equilibrium. For private information, thresholds are closer to the global game solution than for common information. Variations in the payoff function affect behavior as predicted by comparative statics of the global game solution. Predictability of coordination points is about the same for both information conditions.     

Higher Order Uncertainty and Information: Static and Dynamic Games

Weinstein and Yildiz (2007) have shown that in static games, only very weak predictions are robust to perturbations of higher order beliefs. These predictions are precisely those provided by interim correlated rationalizability (ICR). This negative result is obtained under the assumption that agents have no information on payoffs. This assumption is unnatural in many settings. It is therefore natural to ask whether Weinstein and Yildiz's results remain true under more general information structures. This paper characterizes the “robust predictions” in static and dynamic games, under arbitrary information structures. This characterization is provided by an extensive form solution concept: interim sequential rationalizability (ISR). In static games, ISR coincides with ICR and does not depend on the assumptions on agents' information. Hence the “no information” assumption entails no loss of generality in these settings. This is not the case in dynamic games, where ISR refines ICR and depends on the details of the information structure. In these settings, the robust predictions depend on the assumptions on agents' information. This reveals a hitherto neglected interaction between information and higher order uncertainty, raising novel questions of robustness.     

Belief‐Free Equilibria in Repeated Games

We introduce a class of strategies that generalizes examples constructed in two‐player games under imperfect private monitoring. A sequential equilibrium is belief‐free if, after every private history, each player's continuation strategy is optimal independently of his belief about his opponents' private histories. We provide a simple and sharp characterization of equilibrium payoffs using those strategies. While such strategies support a large set of payoffs, they are not rich enough to generate a folk theorem in most games besides the prisoner's dilemma, even when noise vanishes.     

Efficient Use of Information and Social Value of Information

This paper analyzes equilibrium and welfare for a tractable class of economies (games) that have externalities, strategic complementarity or substitutability, and heterogeneous information. First, we characterize the equilibrium use of information: complementarity heightens the sensitivity of equilibrium actions to public information, raising aggregate volatility, whereas substitutability heightens the sensitivity to private information, raising cross‐sectional dispersion. Next, we define and characterize an efficiency benchmark designed to address whether the equilibrium use of information is optimal from a social perspective; the efficient use of information reflects the social value of aligning choices across agents. Finally, we examine the comparative statics of equilibrium welfare with respect to the information structure; the social value of information is best understood by classifying economies according to the inefficiency, if any, in the equilibrium use of information. We conclude with a few applications, including production externalities, beauty contests, business cycles, and large Cournot and Bertrand games.     

Cursed Equilibrium

There is evidence that people do not fully take into account how other people's actions depend on these other people's information. This paper defines and applies a new equilibrium concept in games with private information, cursed equilibrium, which assumes that each player correctly predicts the distribution of other players' actions, but underestimates the degree to which these actions are correlated with other players' information. We apply the concept to common‐values auctions, where cursed equilibrium captures the widely observed phenomenon of the winner's curse, and to bilateral trade, where cursedness predicts trade in adverse‐selections settings for which conventional analysis predicts no trade. We also apply cursed equilibrium to voting and signalling models. We test a single‐parameter variant of our model that embeds Bayesian Nash equilibrium as a special case and find that parameter values that correspond to cursedness fit a broad range of experimental datasets better than the parameter value that corresponds to Bayesian Nash equilibrium.     

股票市场短期时间序列投机对经理投资行为的影响

公司投资行为受股票市场投机影响,投机性时间序列的实质是影响信息收集行为,股市短期时间序列投机者选择接收关于外生震荡不确定性的私人信息,博弈经理投资决策并对经理投资行为产生影响。本文基于信息结构研究股票市场短期时间序列投机对经理投资行为的影响,分析股票市场博弈均衡和经理有效均衡行为,阐明经理低效率投资决策行为的实质。     

Identification and Estimation of a Discrete Game of Complete Information

We discuss the identification and estimation of discrete games of complete information. Following Bresnahan and Reiss (1990, 1991), a discrete game is a generalization of a standard discrete choice model where utility depends on the actions of other players. Using recent algorithms to compute all of the Nash equilibria to a game, we propose simulation‐based estimators for static, discrete games. We demonstrate that the model is identified under weak functional form assumptions using exclusion restrictions and an identification at infinity approach. Monte Carlo evidence demonstrates that the estimator can perform well in moderately sized samples. As an application, we study entry decisions by construction contractors to bid on highway projects in California. We find that an equilibrium is more likely to be observed if it maximizes joint profits, has a higher Nash product, uses mixed strategies, and is not Pareto dominated by another equilibrium.     

Incentives for information sharing in duopoly with capacity constraints

We study the ex ante incentives for firms to share their private information in a Cournot duopoly with capacity constraints. In both demand and cost information sharing games, we show that the incentives can be reversed when some equilibrium solutions are binding on capacity. Especially, we identify some conditions under which partial information sharing is the dominant strategy under both games. Numerical examples are provided for illustration. In addition, we show that information sharing does not necessarily increase social welfare.     

Efficiency in Repeated Games Revisited: The Role of Private Strategies

Most theoretical or applied research on repeated games with imperfect monitoring has focused on public strategies: strategies that depend solely on the history of publicly observable signals. This paper sheds light on the role of private strategies: strategies that depend not only on public signals, but also on players' own actions in the past. Our main finding is that players can sometimes make better use of information by using private strategies and that efficiency in repeated games can be improved. Our equilibrium private strategy for repeated prisoners' dilemma games consists of two states and has the property that each player's optimal strategy is independent of the other player's state.     

Level‐k Auctions: Can a Nonequilibrium Model of Strategic Thinking Explain the Winner's Curse and Overbidding in Private‐Value Auctions?

This paper proposes a structural nonequilibrium model of initial responses to incomplete‐information games based on “level‐k” thinking, which describes behavior in many experiments with complete‐information games. We derive the model's implications in first‐ and second‐price auctions with general information structures, compare them to equilibrium and Eyster and Rabin's (2005) “cursed equilibrium,” and evaluate the model's potential to explain nonequilibrium bidding in auction experiments. The level‐k model generalizes many insights from equilibrium auction theory. It allows a unified explanation of the winner's curse in common‐value auctions and overbidding in those independent‐private‐value auctions without the uniform value distributions used in most experiments.     

Uncertainty about Uncertainty and Delay in Bargaining

We study a one‐sided offers bargaining game in which the buyer has private information about the value of the object and the seller has private information about his beliefs about the buyer's valuation. We show that this uncertainty about uncertainties dramatically changes the set of outcomes. In particular, second order beliefs can lead to a delay in reaching agreement even when the seller makes frequent offers. We show that not all types of second order beliefs lead to a delay. When the buyer assigns positive probability to the seller knowing the buyer's value, then delay not only can occur, but it must occur for a class of equilibria. However, in all other cases delay will never occur.     

Sharp Identification Regions in Models With Convex Moment Predictions

We provide a tractable characterization of the sharp identification region of the parameter vector θ in a broad class of incomplete econometric models. Models in this class have set‐valued predictions that yield a convex set of conditional or unconditional moments for the observable model variables. In short, we call these models with convex moment predictions. Examples include static, simultaneous‐move finite games of complete and incomplete information in the presence of multiple equilibria; best linear predictors with interval outcome and covariate data; and random utility models of multinomial choice in the presence of interval regressors data. Given a candidate value for θ, we establish that the convex set of moments yielded by the model predictions can be represented as the Aumann expectation of a properly defined random set. The sharp identification region of θ, denoted Θ_I, can then be obtained as the set of minimizers of the distance from a properly specified vector of moments of random variables to this Aumann expectation. Algorithms in convex programming can be exploited to efficiently verify whether a candidate θ is in Θ_I. We use examples analyzed in the literature to illustrate the gains in identification and computational tractability afforded by our method.     

Robust allocation of a defensive budget considering an attacker's private information

Attackers' private information is one of the main issues in defensive resource allocation games in homeland security. The outcome of a defense resource allocation decision critically depends on the accuracy of estimations about the attacker's attributes. However, terrorists' goals may be unknown to the defender, necessitating robust decisions by the defender. This article develops a robust-optimization game-theoretical model for identifying optimal defense resource allocation strategies for a rational defender facing a strategic attacker while the attacker's valuation of targets, being the most critical attribute of the attacker, is unknown but belongs to bounded distribution-free intervals. To our best knowledge, no previous research has applied robust optimization in homeland security resource allocation when uncertainty is defined in bounded distribution-free intervals. The key features of our model include (1) modeling uncertainty in attackers' attributes, where uncertainty is characterized by bounded intervals; (2) finding the robust-optimization equilibrium for the defender using concepts dealing with budget of uncertainty and price of robustness; and (3) applying the proposed model to real data.     

Belief‐Free Equilibria in Games With Incomplete Information

We define belief‐free equilibria in two‐player games with incomplete information as sequential equilibria for which players' continuation strategies are best replies after every history, independently of their beliefs about the state of nature. We characterize a set of payoffs that includes all belief‐free equilibrium payoffs. Conversely, any payoff in the interior of this set is a belief‐free equilibrium payoff. The characterization is applied to the analysis of reputations.     

Truthful Equilibria in Dynamic Bayesian Games

This paper characterizes an equilibrium payoff subset for dynamic Bayesian games as discounting vanishes. Monitoring is imperfect, transitions may depend on actions, types may be correlated, and values may be interdependent. The focus is on equilibria in which players report truthfully. The characterization generalizes that for repeated games, reducing the analysis to static Bayesian games with transfers. With independent private values, the restriction to truthful equilibria is without loss, except for the punishment level: if players withhold their information during punishment‐like phases, a folk theorem obtains.     

Repeated Games with Private Monitoring: Two Players

We investigate two‐player infinitely repeated games where the discount factor is less than but close to unity. Monitoring is private and players cannot communicate. We require no condition concerning the accuracy of players' monitoring technology. We show the folk theorem for the prisoners' dilemma with conditional independence. We also investigate more general games where players' private signals are correlated only through an unobservable macro shock. We show that efficiency is sustainable for generic private signal structures when the size of the set of private signals is sufficiently large. Finally, we show that cartel collusion is sustainable in price‐setting duopoly.     

Language Barriers

Different people use language in different ways. We capture this by making language competence—the set of messages an agent can use and understand—private information. Our primary focus is on common‐interest games. Communication generally remains possible; it may be severely impaired even with common knowledge that language competence is adequate; and, indeterminacy of meaning, the confounding of payoff‐relevant information with information about language competence, is optimal.     

Single Crossing Properties and the Existence of Pure Strategy Equilibria in Games of Incomplete Information

This paper analyzes a class of games of incomplete information where each agent has private information about her own type, and the types are drawn from an atomless joint probability distribution. The main result establishes existence of pure strategy Nash equilibria (PSNE) under a condition we call the single crossing condition (SCC), roughly described as follows: whenever each opponent uses a nondecreasing strategy (in the sense that higher types choose higher actions), a player's best response strategy is also nondecreasing. When the SCC holds, a PSNE exists in every finite‐action game. Further, for games with continuous payoffs and a continuum of actions, there exists a sequence of PSNE to finite‐action games that converges to a PSNE of the continuum‐action game. These convergence and existence results also extend to some classes of games with discontinuous payoffs, such as first‐price auctions, where bidders may be heterogeneous and reserve prices are permitted. Finally, the paper characterizes the SCC based on properties of utility functions and probability distributions over types. Applications include first‐price, multi‐unit, and all‐pay auctions; pricing games with incomplete information about costs; and noisy signaling games.     

First‐Price Auctions With General Information Structures: Implications for Bidding and Revenue

We explore the impact of private information in sealed‐bid first‐price auctions. For a given symmetric and arbitrarily correlated prior distribution over values, we characterize the lowest winning‐bid distribution that can arise across all information structures and equilibria. The information and equilibrium attaining this minimum leave bidders indifferent between their equilibrium bids and all higher bids. Our results provide lower bounds for bids and revenue with asymmetric distributions over values. We also report further characterizations of revenue and bidder surplus including upper bounds on revenue. Our work has implications for the identification of value distributions from data on winning bids and for the informationally robust comparison of alternative auction mechanisms.     

Strategic Supply Function Competition With Private Information

A finite number of sellers (n) compete in schedules to supply an elastic demand. The cost of each seller is random, with common and private value components, and the seller receives a private signal about it. A Bayesian supply function equilibrium is characterized: The equilibrium is privately revealing and the incentives to rely on private signals are preserved. Supply functions are steeper with higher correlation among the cost parameters. For high (positive) correlation, supply functions are downward sloping, price is above the Cournot level, and as we approach the common value case, price tends to the collusive level. As correlation becomes maximally negative, we approach the competitive outcome. With positive correlation, private information coupled with strategic behavior induces additional distortionary market power above full information levels. Efficiency can be restored with appropriate subsidy schemes or with a precise enough public signal about the common value component. As the market grows large with the number of sellers, the equilibrium becomes price‐taking, bid shading is on the order of 1/n, and the order of magnitude of welfare losses is 1/n². The results extend to inelastic demand, demand uncertainty, and demand schedule competition. A range of applications in product and financial markets is presented.