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.     

Inference of Signs of Interaction Effects in Simultaneous Games With Incomplete Information

This paper studies the inference of interaction effects in discrete simultaneous games with incomplete information. We propose a test for the signs of state‐dependent interaction effects that does not require parametric specifications of players' payoffs, the distributions of their private signals, or the equilibrium selection mechanism. The test relies on the commonly invoked assumption that players' private signals are independent conditional on observed states. The procedure is valid in (but does not rely on) the presence of multiple equilibria in the data‐generating process (DGP). As a by‐product, we propose a formal test for multiple equilibria in the DGP. We also implement the test using data on radio programming of commercial breaks in the United States, and infer stations' incentives to synchronize their commercial breaks. Our results support the earlier finding by Sweeting (2009) that stations have stronger incentives to coordinate and air commercials at the same time during rush hours and in smaller markets.     

Games with Imperfectly Observable Actions in Continuous Time

This paper investigates a new class of two‐player games in continuous time, in which the players' observations of each other's actions are distorted by Brownian motions. These games are analogous to repeated games with imperfect monitoring in which the players take actions frequently. Using a differential equation, we find the set ℰ(r) of payoff pairs achievable by all public perfect equilibria of the continuous‐time game, where r is the discount rate. The same differential equation allows us to find public perfect equilibria that achieve any value pair on the boundary of the set ℰ(r). These public perfect equilibria are based on a pair of continuation values as a state variable, which moves along the boundary of ℰ(r) during the course of the game. In order to give players incentives to take actions that are not static best responses, the pair of continuation values is stochastically driven by the players' observations of each other's actions along the boundary of the set ℰ(r).     

Weakly Belief‐Free Equilibria in Repeated Games With Private Monitoring

Repeated games with imperfect private monitoring have a wide range of applications, but a complete characterization of all equilibria in this class of games has yet to be obtained. The existing literature has identified a relatively tractable subset of equilibria. The present paper introduces the notion of weakly belief‐free equilibria for repeated games with imperfect private monitoring. This is a tractable class which subsumes, as a special case, a major part of the existing literature (the belief‐free equilibria). It is shown that this class can outperform the equilibria identified by the previous work.     

Cognition and Behavior in Normal‐Form Games: An Experimental Study

This paper reports experiments designed to study strategic sophistication, the extent to which behavior in games reflects attempts to predict others’ decisions, taking their incentives into account. We study subjects’ initial responses to normal‐form games with various patterns of iterated dominance and unique pure‐strategy equilibria without dominance, using a computer interface that allowed them to search for hidden payoff information, while recording their searches. Monitoring subjects’ information searches along with their decisions allows us to better understand how their decisions are determined, and subjects’ deviations from the search patterns suggested by equilibrium analysis help to predict their deviations from equilibrium decisions.     

Large Robust Games

With many semi‐anonymous players, the equilibria of simultaneous‐move games are extensively robust. This means that the equilibria survive even if the simultaneous‐play assumption is relaxed to allow for a large variety of extensive modifications. Such modifications include sequential play with partial and differential revelation of information, commitments, multiple revisions of choices, cheap talk announcements, and more.     

Sequential Estimation of Dynamic Discrete Games

This paper studies the estimation of dynamic discrete games of incomplete information. Two main econometric issues appear in the estimation of these models: the indeterminacy problem associated with the existence of multiple equilibria and the computational burden in the solution of the game. We propose a class of pseudo maximum likelihood (PML) estimators that deals with these problems, and we study the asymptotic and finite sample properties of several estimators in this class. We first focus on two‐step PML estimators, which, although they are attractive for their computational simplicity, have some important limitations: they are seriously biased in small samples; they require consistent nonparametric estimators of players' choice probabilities in the first step, which are not always available; and they are asymptotically inefficient. Second, we show that a recursive extension of the two‐step PML, which we call nested pseudo likelihood (NPL), addresses those drawbacks at a relatively small additional computational cost. The NPL estimator is particularly useful in applications where consistent nonparametric estimates of choice probabilities either are not available or are very imprecise, e.g., models with permanent unobserved heterogeneity. Finally, we illustrate these methods in Monte Carlo experiments and in an empirical application to a model of firm entry and exit in oligopoly markets using Chilean data from several retail industries.     

On the Existence of Monotone Pure‐Strategy Equilibria in Bayesian Games

We generalize Athey's (2001) and McAdams' (2003) results on the existence of monotone pure‐strategy equilibria in Bayesian games. We allow action spaces to be compact locally complete metric semilattices and type spaces to be partially ordered probability spaces. Our proof is based on contractibility rather than convexity of best‐reply sets. Several examples illustrate the scope of the result, including new applications to multi‐unit auctions with risk‐averse bidders.     

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.     

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.     

Markov Perfect Industry Dynamics With Many Firms

We propose an approximation method for analyzing Ericson and Pakes (1995)‐style dynamic models of imperfect competition. We define a new equilibrium concept that we call oblivious equilibrium, in which each firm is assumed to make decisions based only on its own state and knowledge of the long‐run average industry state, but where firms ignore current information about competitors' states. The great advantage of oblivious equilibria is that they are much easier to compute than are Markov perfect equilibria. Moreover, we show that, as the market becomes large, if the equilibrium distribution of firm states obeys a certain “light‐tail” condition, then oblivious equilibria closely approximate Markov perfect equilibria. This theorem justifies using oblivious equilibria to analyze Markov perfect industry dynamics in Ericson and Pakes (1995)‐style models with many firms.     

Sequential Estimation of Dynamic Discrete Games: A Comment

Recursive procedures which are based on iterating on the best response mapping have difficulties converging to all equilibria in multi‐player games. We illustrate these difficulties by revisiting the asymptotic properties of the iterative nested pseudo maximum likelihood method for estimating dynamic games introduced by Aguirregabiria and Mira (2007). An example shows that the iterative method may not be consistent.     

A Theory of Disagreement in Repeated Games With Bargaining

This paper proposes a new approach to equilibrium selection in repeated games with transfers, supposing that in each period the players bargain over how to play. Although the bargaining phase is cheap talk (following a generalized alternating‐offer protocol), sharp predictions arise from three axioms. Two axioms allow the players to meaningfully discuss whether to deviate from their plan; the third embodies a “theory of disagreement”—that play under disagreement should not vary with the manner in which bargaining broke down. Equilibria that satisfy these axioms exist for all discount factors and are simple to construct; all equilibria generate the same welfare. Optimal play under agreement generally requires suboptimal play under disagreement. Whether patient players attain efficiency depends on both the stage game and the bargaining protocol. The theory extends naturally to games with imperfect public monitoring and heterogeneous discount factors, and yields new insights into classic relational contracting questions.     

Genericity and Markovian Behavior in Stochastic Games

This paper examines Markov perfect equilibria of general, finite state stochastic games. Our main result is that the number of such equilibria is finite for a set of stochastic game payoffs with full Lebesgue measure. We further discuss extensions to lower dimensional stochastic games like the alternating move game.     

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.     

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.     

Beliefs in Repeated Games

Consider a two‐player discounted infinitely repeated game. A player's belief is a probability distribution over the opponent's repeated game strategies. This paper shows that, for a large class of repeated games, there are no beliefs that satisfy three properties: learnability, a diversity of belief condition called CSP, and consistency. Loosely, if players learn to forecast the path of play whenever each plays a strategy that the other anticipates (in the sense of being in the support of that player's belief) and if the sets of anticipated strategies are sufficiently rich, then neither anticipates any of his opponent's best responses. This generalizes results in Nachbar (1997).     

Definable and Contractible Contracts

This paper analyzes Bayesian normal form games in which players write contracts that condition their actions on the contracts of other players. These contracts are required to be representable in a formal language. This is accomplished by constructing contracts which are definable functions of the Godel code of every other player's contract. We provide a complete characterization of the set of allocations supportable as pure‐strategy Bayesian equilibria of this contracting game. When information is complete, this characterization provides a folk theorem. In general, the set of supportable allocations is smaller than the set supportable by a centralized mechanism designer.     

Information Independence and Common Knowledge

In Bayesian environments with private information, as described by the types of Harsanyi, how can types of agents be (statistically) disassociated from each other and how are such disassociations reflected in the agents' knowledge structure? Conditions studied are (i) subjective independence (the opponents' types are independent conditional on one's own) and (ii) type disassociation under common knowledge (the agents' types are independent, conditional on some common‐knowledge variable). Subjective independence is motivated by its implications in Bayesian games and in studies of equilibrium concepts. We find that a variable that disassociates types is more informative than any common‐knowledge variable. With three or more agents, conditions (i) and (ii) are equivalent. They also imply that any variable which is common knowledge to two agents is common knowledge to all, and imply the existence of a unique common‐knowledge variable that disassociates types, which is the one defined by Aumann.