Tenable Strategy Blocks and Settled Equilibria

When people interact in familiar settings, social conventions usually develop so that people tend to disregard alternatives outside the convention. For rational players to usually restrict attention to a block of conventional strategies, no player should prefer to deviate from the block when others are likely to act conventionally and rationally inside the block. We explore two set‐valued concepts, coarsely and finely tenable blocks, that formalize this notion for finite normal‐form games. We then identify settled equilibria, which are Nash equilibria with support in minimal tenable blocks. For a generic class of normal‐form games, our coarse and fine concepts are equivalent, and yet they differ from standard solution concepts on open sets of games. We demonstrate the nature and power of the solutions by way of examples. Settled equilibria are closely related to persistent equilibria but are strictly more selective on an open set of games. With fine tenability, we obtain invariance under the insertion of a subgame with a unique totally mixed payoff‐equivalent equilibrium, a property that other related concepts have not satisfied.     

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.     

Bayesian Learning,Smooth Approximate Optimal Behavior,and Convergence to ε‐Nash Equilibrium

In this paper, I construct players' prior beliefs and show that these prior beliefs lead the players to learn to play an approximate Nash equilibrium uniformly in any infinitely repeated slightly perturbed game with discounting and perfect monitoring. That is, given any ε > 0, there exists a (single) profile of players' prior beliefs that leads play to almost surely converge to an ε‐Nash equilibrium uniformly for any (finite normal form) stage game with slight payoff perturbation and any discount factor less than 1.     

Utilitarian Preferences With Multiple Priors

This paper proposes a method for aggregating individual preferences in the context of uncertainty. Individuals are assumed to abide by Savage's model of Subjective Expected Utility, in which everyone has his/her own utility and subjective probability. Disagreement on probabilities among individuals gives rise to uncertainty at the societal level, and thus society may entertain a set of probabilities rather than only one. We assume that social preference admits a Maxmin Expected Utility representation. In this context, two Pareto‐type conditions are shown to be equivalent to social utility being a weighted average of individual utilities and the social set of priors containing only weighted averages of individual priors. Thus, society respects consensus among individuals' beliefs and does not add ambiguity beyond disagreement on beliefs. We also deal with the case in which society does not rule out any individual belief.     

Understanding the Price Effects of the MillerCoors Joint Venture

We document abrupt increases in retail beer prices just after the consummation of the MillerCoors joint venture, both for MillerCoors and its major competitor, Anheuser‐Busch. Within the context of a differentiated‐products pricing model, we test and reject the hypothesis that the price increases can be explained by movement from one Nash–Bertrand equilibrium to another. Counterfactual simulations imply that prices after the joint venture are 6%–8% higher than they would have been with Nash–Bertrand competition, and that markups are 17%–18% higher. We relate the results to documentary evidence that the joint venture may have facilitated price coordination.     

Spurious Inference in Reduced‐Rank Asset‐Pricing Models

This note studies some seemingly anomalous results that arise in possibly misspecified, reduced‐rank linear asset‐pricing models estimated by the continuously updated generalized method of moments. When a spurious factor (that is, a factor that is uncorrelated with the returns on the test assets) is present, the test for correct model specification has asymptotic power that is equal to the nominal size. In other words, applied researchers will erroneously conclude that the model is correctly specified even when the degree of misspecification is arbitrarily large. The rejection probability of the test for overidentifying restrictions typically decreases further in underidentified models where the dimension of the null space is larger than 1.     

The Effect of Changes in Risk Attitude on Strategic Behavior

We study families of normal‐form games with fixed preferences over pure action profiles but varied preferences over lotteries. That is, we subject players' utilities to monotone but nonlinear transformations and examine changes in the rationalizable set and set of equilibria. Among our results: The rationalizable set always grows under concave transformations (risk aversion) and shrinks under convex transformations (risk love). The rationalizable set reaches an upper bound under extreme risk aversion, and lower bound under risk love, and both of these bounds are characterized by elimination processes. For generic two‐player games, under extreme risk love or aversion, all Nash equilibria are close to pure and the limiting set of equilibria can be described using preferences over pure action profiles.     

Progressive Learning

We study a dynamic principal–agent relationship with adverse selection and limited commitment. We show that when the relationship is subject to productivity shocks, the principal may be able to improve her value over time by progressively learning the agent's private information. She may even achieve her first‐best payoff in the long run. The relationship may also exhibit path dependence, with early shocks determining the principal's long‐run value. These findings contrast sharply with the results of the ratchet effect literature, in which the principal persistently obtains low payoffs, giving up substantial informational rents to the agent.     

Bounded Memory and Biases in Information Processing

Before choosing among two actions with state‐dependent payoffs, a Bayesian decision‐maker with a finite memory sees a sequence of informative signals, ending each period with fixed chance. He summarizes information observed with a finite‐state automaton. I characterize the optimal protocol as an equilibrium of a dynamic game of imperfect recall; a new player runs each memory state each period. Players act as if maximizing expected payoffs in a common finite action decision problem. I characterize equilibrium play with many multinomial signals. The optimal protocol rationalizes many behavioral phenomena, like “stickiness,” salience, confirmation bias, and belief polarization.     

Rushes in Large Timing Games

We develop a continuum player timing game that subsumes standard wars of attrition and pre‐emption games, and introduces a new rushes phenomenon. Payoffs are continuous and single‐peaked functions of the stopping time and stopping quantile. We show that if payoffs are hump‐shaped in the quantile, then a sudden “rush” of players stops in any Nash or subgame perfect equilibrium. Fear relaxes the first mover advantage in pre‐emption games, asking that the least quantile beat the average; greed relaxes the last mover advantage in wars of attrition, asking just that the last quantile payoff exceed the average. With greed, play is inefficiently late: an accelerating war of attrition starting at optimal time, followed by a rush. With fear, play is inefficiently early: a slowing pre‐emption game, ending at the optimal time, preceded by a rush. The theory predicts the length, duration, and intensity of stopping, and the size and timing of rushes, and offers insights for many common timing games.     

A Dynamic Reinterpretation of Nash Bargaining With Endogenous Threats

This paper concerns the two‐stage game introduced in Nash (1953). It formalizes a suggestion made (but not pursued) by Nash regarding equilibrium selection in that game, and hence offers an arguably more solid foundation for the “Nash bargaining with endogenous threats” solution. Analogous reasoning is then applied to an infinite horizon game to provide equilibrium selection in two‐person repeated games with contracts. In this setting, issues about enforcement of threats are much less problematic than in Nash's static setting. The analysis can be extended to stochastic games with contracts.     

Who's Who in Networks. Wanted: The Key Player

Finite population noncooperative games with linear‐quadratic utilities, where each player decides how much action she exerts, can be interpreted as a network game with local payoff complementarities, together with a globally uniform payoff substitutability component and an own‐concavity effect. For these games, the Nash equilibrium action of each player is proportional to her Bonacich centrality in the network of local complementarities, thus establishing a bridge with the sociology literature on social networks. This Bonacich–Nash linkage implies that aggregate equilibrium increases with network size and density. We then analyze a policy that consists of targeting the key player, that is, the player who, once removed, leads to the optimal change in aggregate activity. We provide a geometric characterization of the key player identified with an intercentrality measure, which takes into account both a player's centrality and her contribution to the centrality of the others.     

Identifying Equilibrium Models of Labor Market Sorting

We assess the empirical content of equilibrium models of labor market sorting based on unobserved (to economists) characteristics. In particular, we show theoretically that all parameters of the classic model of sorting based on absolute advantage in Becker, 1973 with search frictions can be nonparametrically identified using only matched employer–employee data on wages and labor market transitions. In particular, these data are sufficient to nonparametrically estimate the output of any individual worker with any given firm. Our identification proof is constructive and we provide computational algorithms that implement our identification strategy given the limitations of the available data sets. Finally, we add on‐the‐job search to the model, extend the identification strategy, and apply it to a large German matched employer–employee data set to describe detailed patterns of sorting and properties of the production function.     

Sales Force and Competition in Financial Product Markets: The Case of Mexico's Social Security Privatization

This paper examines how sales force impacts competition and equilibrium prices in the context of a privatized pension market. We use detailed administrative data on fund manager choices and worker characteristics at the inception of Mexico's privatized social security system, where fund managers had to set prices (management fees) at the national level, but could select sales force levels by local geographic areas. We develop and estimate a model of fund manager choice where sales force can increase or decrease customer price sensitivity. We find exposure to sales force lowered price sensitivity, leading to inelastic demand and high equilibrium fees. We simulate oft proposed policy solutions: a supply‐side policy with a competitive government player and a demand‐side policy that increases price elasticity. We find that demand‐side policies are necessary to foster competition in social safety net markets with large segments of inelastic consumers.     

A Competitive Model of Customization with Lead‐Time Effects

In this article, we study the competitive interactions between a firm producing standard products and a firm producing custom products. Consumers with heterogeneous preferences choose between n standard products, which may not meet their preferences exactly but are available immediately, and a custom product, available only after a certain lead time l. Standard products incur a variety cost that increases with n and custom products incur a lead time cost that is decreasing in the lead time l. We consider a two‐stage game wherein at stage 1, the standard product firm chooses the variety and the custom firm chooses the lead time and then both firms set prices simultaneously. We characterize the subgame‐perfect Nash equilibrium of the game. We find that both firms can coexist in equilibrium, either sharing the market as local monopolists or in a price‐competitive mode. The standard product firm may offer significant or minimal variety depending on the equilibrium outcome. We provide several interesting insights on the variety, lead time, and prices of the products offered and on the impact of problem parameters on the equilibrium outcomes. For instance, we show that the profit margin and price of the custom product are likely to be higher than that of standard products in equilibrium under certain conditions. Also, custom firms are more likely to survive and succeed in product markets with larger potential market sizes. Another interesting insight is that increased consumer sensitivity to product fit may result in lower lead time for the custom product.     

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.     

Altruism in Networks

We provide the first analysis of altruism in networks. Agents are embedded in a fixed network and care about the well‐being of their network neighbors. Depending on incomes, they may provide financial support to their poorer friends. We study the Nash equilibria of the resulting game of transfers. We show that equilibria maximize a concave potential function. We establish existence, uniqueness of equilibrium consumption, and generic uniqueness of equilibrium transfers. We characterize the geometry of the network of transfers and highlight the key role played by transfer intermediaries. We then study comparative statics. A positive income shock to an individual benefits all. For small changes in incomes, agents in a component of the network of transfers act as if they were organized in an income‐pooling community. A decrease in income inequality or expansion of the altruism network may increase consumption inequality.     

Communication With Unknown Perspectives

Consider a group of individuals with unobservable perspectives (subjective prior beliefs) about a sequence of states. In each period, each individual receives private information about the current state and forms an opinion (a posterior belief). She also chooses a target individual and observes the target's opinion. This choice involves a trade‐off between well‐informed targets, whose signals are precise, and well‐understood targets, whose perspectives are well known. Opinions are informative about the target's perspective, so observed individuals become better understood over time. We identify a simple condition under which long‐run behavior is history independent. When this fails, each individual restricts attention to a small set of experts and observes the most informed among these. A broad range of observational patterns can arise with positive probability, including opinion leadership and information segregation. In an application to areas of expertise, we show how these mechanisms generate own field bias and large field dominance.     

Reinforcement‐based vs. Belief‐based Learning Models in Experimental Asymmetric‐information Games

This paper examines the abilities of learning models to describe subject behavior in experiments. A new experiment involving multistage asymmetric‐information games is conducted, and the experimental data are compared with the predictions of Nash equilibrium and two types of learning model: a reinforcement‐based model similar to that used by Roth and Erev (1995), and belief‐based models similar to the ‘cautious fictitious play’ of Fudenberg and Levine (1995, 1998) These models make predictions that are qualitatively similar cycling around the Nash equilibrium that is much more apparent than movement toward it. While subject behavior is not adequately described by Nash equilibrium, it is consistent with the qualitative predictions of the learning models. We examine several criteria for quantitatively comparing the predictions of alternative models. According to almost all of these criteria, both types of learning model outperform Nash equilibrium. According to some criteria, the reinforcement‐based model performs better than any version of the belief‐based model; according to others, there exist versions of the belief‐based model that outperform the reinforcement‐based model. The abilities of these models are further tested with respect to the results of other published experiments. The relative performance of the two learning models depends on the experiment, and varies according to which criterion of success is used. Again, both models perform better than equilibrium in most cases.     

Networks in Conflict: Theory and Evidence From the Great War of Africa

We study from both a theoretical and an empirical perspective how a network of military alliances and enmities affects the intensity of a conflict. The model combines elements from network theory and from the politico‐economic theory of conflict. We obtain a closed‐form characterization of the Nash equilibrium. Using the equilibrium conditions, we perform an empirical analysis using data on the Second Congo War, a conflict that involves many groups in a complex network of informal alliances and rivalries. The estimates of the fighting externalities are then used to infer the extent to which the conflict intensity can be reduced through (i) dismantling specific fighting groups involved in the conflict; (ii) weapon embargoes; (iii) interventions aimed at pacifying animosity among groups. Finally, with the aid of a random utility model, we study how policy shocks can induce a reshaping of the network structure.