Relational Incentive Contracts With Persistent Private Information

This paper investigates relational incentive contracts with continuous, privately observed agent types that are persistent over time. With fixed agent types, full separation is not possible when continuation equilibrium payoffs following revelation are on the Pareto frontier of attainable payoffs. This result is related to the ratchet effect in that: (1) a type imitating a less productive type receives an information rent, and (2) with full separation, one imitating a more productive type receives the same future payoff as that more productive type. However, the reason for (2) is fundamentally different than with the ratchet effect. It arises from the dynamic enforcement requirement in relational contracts, not from the principal having all the bargaining power, and applies whatever the distribution between principal and agent of the future gains from the relationship (i.e., whatever the point on the Pareto frontier). This result extends to sufficiently persistent types under certain conditions.     

Fiscal Rules and Discretion Under Persistent Shocks

This paper studies the optimal level of discretion in policymaking. We consider a fiscal policy model where the government has time‐inconsistent preferences with a present bias toward public spending. The government chooses a fiscal rule to trade off its desire to commit to not overspend against its desire to have flexibility to react to privately observed shocks to the value of spending. We analyze the optimal fiscal rule when the shocks are persistent. Unlike under independent and identically distributed shocks, we show that the ex ante optimal rule is not sequentially optimal, as it provides dynamic incentives. The ex ante optimal rule exhibits history dependence, with high shocks leading to an erosion of future fiscal discipline compared to low shocks, which lead to the reinstatement of discipline. The implied policy distortions oscillate over time given a sequence of high shocks, and can force the government to accumulate maximal debt and become immiserated in the long run.     

Information Frictions in Trade

It is costly to learn about market conditions elsewhere, especially in developing countries. This paper examines how such information frictions affect trade. Using data on regional agricultural trade in the Philippines, I first document a number of observed patterns in trade flows and prices that suggest the presence of information frictions. I then incorporate information frictions into a perfect competition trade model by embedding a process whereby heterogeneous producers engage in a costly sequential search process to determine where to sell their produce. I show that introducing information frictions reconciles the theory with the observed patterns in the data. Structural estimation of the model finds that information frictions are quantitatively important: roughly half the observed regional price dispersion is due to information frictions. Furthermore, incorporating information frictions improves the out‐of‐sample predictive power of the model.     

Asset Markets With Heterogeneous Information

This paper studies competitive equilibria of economies where assets are heterogeneous and traders have heterogeneous information about them. Markets are defined by a price and a procedure for clearing trades, and any asset can, in principle, be traded in any market. Buyers can use their information to impose acceptance rules which specify which assets they are willing to trade in each market. The set of markets where trade takes place is derived endogenously. The model can be applied to find conditions under which these economies feature fire sales, contagion, and flights to quality.     

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.     

Tight Revenue Bounds With Possibilistic Beliefs and Level‐k Rationality

Mechanism design enables a social planner to obtain a desired outcome by leveraging the players' rationality and their beliefs. It is thus a fundamental, but yet unproven, intuition that the higher the level of rationality of the players, the better the set of obtainable outcomes. In this paper, we prove this fundamental intuition for players with possibilistic beliefs, a model long considered in epistemic game theory. Specifically, • We define a sequence of monotonically increasing revenue benchmarks for single‐good auctions, G⁰≤G¹≤G²≤⋯, where each Gⁱ is defined over the players' beliefs and G⁰ is the second‐highest valuation (i.e., the revenue benchmark achieved by the second‐price mechanism). • We (1) construct a single, interim individually rational, auction mechanism that, without any clue about the rationality level of the players, guarantees revenue G^k if all players have rationality levels ≥k+1, and (2) prove that no such mechanism can guarantee revenue even close to G^k when at least two players are at most level‐k rational.     

Experimental Games on Networks: Underpinnings of Behavior and Equilibrium Selection

In this paper, we describe a series of laboratory experiments that implement specific examples of a general network structure. Specifically, actions are either strategic substitutes or strategic complements, and participants have either complete or incomplete information about the structure of a random network. Since economic environments typically have a considerable degree of complementarity or substitutability, this framework applies to a wide variety of settings. We examine behavior and equilibrium selection. The degree of equilibrium play is striking, in particular with incomplete information. Behavior closely resembles the theoretical equilibrium whenever this is unique; when there are multiple equilibria, general features of networks, such as connectivity, clustering, and the degree of the players, help to predict informed behavior in the lab. People appear to be strongly attracted to maximizing aggregate payoffs (social efficiency), but there are forces that moderate this attraction: (1) people seem content with (in the aggregate) capturing only the lion's share of the efficient profits in exchange for reduced exposure to loss, and (2) uncertainty about the network structure makes it considerably more difficult to coordinate on a demanding, but efficient, equilibrium that is typically implemented with complete information.     

When Does Predation Dominate Collusion?

I study repeated competition among oligopolists. The only novelty is that firms may go bankrupt and permanently exit: the probability that a firm survives a price war depends on its financial strength, which varies stochastically over time. Under some conditions including no entry, an anti‐folk theorem holds: when firms are patient, so that strength levels change relatively quickly, every Nash equilibrium involves an immediate price war that lasts until at most one firm remains. Surprisingly, the possibility of entry may facilitate collusion, as may impatience. The model can explain some observed patterns of collusion and predation.     

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.     

Robust Confidence Regions for Incomplete Models

Call an economic model incomplete if it does not generate a probabilistic prediction even given knowledge of all parameter values. We propose a method of inference about unknown parameters for such models that is robust to heterogeneity and dependence of unknown form. The key is a Central Limit Theorem for belief functions; robust confidence regions are then constructed in a fashion paralleling the classical approach. Monte Carlo simulations support tractability of the method and demonstrate its enhanced robustness relative to existing methods.     

Continuity,Inertia, and Strategic Uncertainty: A Test of the Theory of Continuous Time Games

The theory of continuous time games (Simon and Stinchcombe (1989), Bergin and MacLeod (1993)) shows that continuous time interactions can generate very different equilibrium behavior than conventional discrete time interactions. We introduce new laboratory methods that allow us to eliminate natural inertia in subjects' decisions in continuous time experiments, thereby satisfying critical premises of the theory and enabling a first‐time direct test. Applying these new methods to a simple timing game, we find strikingly large gaps in behavior between discrete and continuous time as the theory suggests. Reintroducing natural inertia into these games causes continuous time behavior to collapse to discrete time‐like levels in some settings as predicted by subgame perfect Nash equilibrium. However, contra this prediction, the strength of this effect is fundamentally shaped by the severity of inertia: behavior tends towards discrete time benchmarks as inertia grows large and perfectly continuous time benchmarks as it falls towards zero. We provide evidence that these results are due to changes in the nature of strategic uncertainty as inertia approaches the continuous limit.     

Generalized Instrumental Variable Models

This paper develops characterizations of identified sets of structures and structural features for complete and incomplete models involving continuous or discrete variables. Multiple values of unobserved variables can be associated with particular combinations of observed variables. This can arise when there are multiple sources of heterogeneity, censored or discrete endogenous variables, or inequality restrictions on functions of observed and unobserved variables. The models generalize the class of incomplete instrumental variable (IV) models in which unobserved variables are single‐valued functions of observed variables. Thus the models are referred to as generalized IV (GIV) models, but there are important cases in which instrumental variable restrictions play no significant role. Building on a definition of observational equivalence for incomplete models the development uses results from random set theory that guarantee that the characterizations deliver sharp bounds, thereby dispensing with the need for case‐by‐case proofs of sharpness. The use of random sets defined on the space of unobserved variables allows identification analysis under mean and quantile independence restrictions on the distributions of unobserved variables conditional on exogenous variables as well as under a full independence restriction. The results are used to develop sharp bounds on the distribution of valuations in an incomplete model of English auctions, improving on the pointwise bounds available until now. Application of many of the results of the paper requires no familiarity with random set theory.     

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.     

Stochastic Learning Dynamics and Speed of Convergence in Population Games

We study how long it takes for large populations of interacting agents to come close to Nash equilibrium when they adapt their behavior using a stochastic better reply dynamic. Prior work considers this question mainly for 2 × 2 games and potential games; here we characterize convergence times for general weakly acyclic games, including coordination games, dominance solvable games, games with strategic complementarities, potential games, and many others with applications in economics, biology, and distributed control. If players' better replies are governed by idiosyncratic shocks, the convergence time can grow exponentially in the population size; moreover, this is true even in games with very simple payoff structures. However, if their responses are sufficiently correlated due to aggregate shocks, the convergence time is greatly accelerated; in fact, it is bounded for all sufficiently large populations. We provide explicit bounds on the speed of convergence as a function of key structural parameters including the number of strategies, the length of the better reply paths, the extent to which players can influence the payoffs of others, and the desired degree of approximation to Nash equilibrium.     

Trade Credit and the Propagation of Corporate Failure: An Empirical Analysis

Using an exhaustive data set on claims held by trade creditors (suppliers) on failed trade debtors (customers), we quantify the importance of trade credit chains for the propagation of corporate bankruptcy. We show that trade creditors experience significant trade credit losses due to trade debtor failures and that creditors' bankruptcy risks increase in the size of incurred losses. By exploring the roles of financial constraints and creditor‐debtor dependences, we infer that the trade credit failure propagation mechanism is driven by both credit losses and demand shrinkage. Finally, we show that the documented propagation mechanism constitutes a significant part of the overall bankruptcy frequency, suggesting that it has measurable implications for the aggregate level.     

Impatience versus Incentives

This paper studies the dynamics of long‐term contracts in repeated principal–agent relationships with an impatient agent. Despite the absence of exogenous uncertainty, Pareto‐optimal dynamic contracts generically oscillate between favoring the principal and favoring the agent.     

Recursive Equilibria in Dynamic Economies With Stochastic Production

In this paper, we prove the existence of recursive equilibria in a dynamic stochastic model with infinitely lived heterogeneous agents, several commodities, and general inter‐ and intratemporal production. We illustrate the usefulness of our result by providing sufficient conditions for the existence of recursive equilibria in heterogeneous agent versions of both the Lucas asset pricing model and the neoclassical stochastic growth model.     

Money as a Unit of Account

We develop a theory that rationalizes the use of a dominant unit of account in an economy. Agents enter into non‐contingent contracts with a variety of business partners. Trade unfolds sequentially in credit chains and is subject to random matching. By using a dominant unit of account, agents can lower their exposure to relative price risk, avoid costly default, and create more total surplus. We discuss conditions under which it is optimal to adopt circulating government paper as the dominant unit of account, and the optimal choice of “currency areas” when there is variation in the intensity of trade within and across regions.     

Strategic Learning and the Topology of Social Networks

We consider a group of strategic agents who must each repeatedly take one of two possible actions. They learn which of the two actions is preferable from initial private signals and by observing the actions of their neighbors in a social network. We show that the question of whether or not the agents learn efficiently depends on the topology of the social network. In particular, we identify a geometric “egalitarianism” condition on the social network that guarantees learning in infinite networks, or learning with high probability in large finite networks, in any equilibrium. We also give examples of nonegalitarian networks with equilibria in which learning fails.     

Large Matching Markets as Two‐Sided Demand Systems

This paper studies two‐sided matching markets with non‐transferable utility when the number of market participants grows large. We consider a model in which each agent has a random preference ordering over individual potential matching partners, and agents' types are only partially observed by the econometrician. We show that in a large market, the inclusive value is a sufficient statistic for an agent's endogenous choice set with respect to the probability of being matched to a spouse of a given observable type. Furthermore, while the number of pairwise stable matchings for a typical realization of random utilities grows at a fast rate as the number of market participants increases, the inclusive values resulting from any stable matching converge to a unique deterministic limit. We can therefore characterize the limiting distribution of the matching market as the unique solution to a fixed‐point condition on the inclusive values. Finally we analyze identification and estimation of payoff parameters from the asymptotic distribution of observable characteristics at the level of pairs resulting from a stable matching.